• TOTAL COLORING OF STAR, WHEEL AND HELM GRAPH FAMILY
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](https://i.creativecommons.org/l/by-nc-sa/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2024 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |