Results on Grundy Chromatic Number of Prism graphs

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.