Year: 2025
Type: article
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.
Authors: Annathurai K, P. Periasamy, V. Sankar Raj
Institution: Manonmaniam Sundaranar University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W7116915664