Results on Grundy Chromatic Number of Prism graphs

Authors

  • K. Annathurai Department Of Mathematics, Thiruvalluvar College, Papanasam, Tirunelveli-627425, Tamilnadu, India
  • P. Periasamy Part time Research Scholar, Manonmaniam Sundaranar University, Tirunelveli-627012, Tamilnadu, India
  • V. Sankar Raj Department Of Mathematics, Manonmaniam Sundaranar University, Tirunelveli-627012, Tamilnadu, India

DOI:

https://doi.org/10.19139/soic-2310-5070-3093

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.  

Author Biographies

K. Annathurai, Department Of Mathematics, Thiruvalluvar College, Papanasam, Tirunelveli-627425, Tamilnadu, India

   

V. Sankar Raj, Department Of Mathematics, Manonmaniam Sundaranar University, Tirunelveli-627012, Tamilnadu, India

   

Downloads

Published

2025-12-17

How to Cite

K, A., P. Periasamy, & V. Sankar Raj. (2025). Results on Grundy Chromatic Number of Prism graphs. Statistics, Optimization & Information Computing, 15(3), 1810–1820. https://doi.org/10.19139/soic-2310-5070-3093

Issue

Section

Research Articles