• TOTAL COLORING OF STAR, WHEEL AND HELM GRAPH FAMILY
R. Arundhadhi, V. Ilayarani · 2017
A total coloring of a graph G is an assignment of colors to both the vertices and edges of G such that adjacent or incident elements of G are not colored with the same color. The total chromatic number of a graph G is a smallest positive integer for which G admits a total coloring. In this paper, we obtain the total chromatic number of Star, Wheel and helm graph.