Results on Grundy Chromatic Number of Prism graphs
Keywords:
Grundy chromatic number; Prism and Antiprism graphs
Abstract
A coloring of a graph G is a proper vertex coloring of G having the property that for every two colors i and j with i < j, every vertex colored j has a neighbor colored i. we acquire the Grundy chromatic number of prism, Crossed Prism graph, Antiprism graph and the Line graph of Crossed Prism graph with suitable illustrations whenever necessary.
Published
2025-12-17
How to Cite
K, A., P, P., & V, S. R. (2025). Results on Grundy Chromatic Number of Prism graphs. Statistics, Optimization & Information Computing. https://doi.org/10.19139/soic-2310-5070-3093
Issue
Section
Research Articles
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
