• TOTAL COLORING OF STAR, WHEEL AND HELM GRAPH FAMILY

R. ARUNDHADHI*, V. ILAYARANI

Abstract


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.


Keywords


: Total coloring, total chromatic number Star, Wheel, and Helm graph.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 Unported License.
© 2010-2016 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
HTML Counter
Counter