Equitable Total Coloring of Star Graph Families

Main Article Content

E. Martin Susairaj, T. Iswarya

Abstract

A proper total coloring of a graph G is said to be equitable, if the numberof elements (vertices and edges) in any two color classes differ by at most one, for which therequired minimum number of colors is called the equitable total chromatic number. In thispaper, we determine equitable total chromatic numbers of double star graph, bistar graph and splitting graph of star graph.

Article Details

Section
Articles