Total Coloring of Central Graphs of a Path, a Cycle and a Star
S.Sudha,K.Manikandan
Citation : S.Sudha,K.Manikandan, Total Coloring of Central Graphs of a Path, a Cycle and a Star International Journal of Scientific and Innovative Mathematical Research 2017,5(10) : 15-22
The total chromatic number of a graph ?? is defined to be the minimum number of colors needed to color the vertices and edges of a graph in such a way that no two adjacent vertices, no two adjacent edges and no incident vertex and edge are given the same color. In this paper, we discussed the total coloring and total chromatic number of the central graphs of a path, a cycle and a star.