On the Equitable Total Coloring of Multiple Join-Graph
Zhang Zhong-fu · Journal of Mathematical Research and Exposition · 2007
A total-coloring is called equitable if | | Si | - | Sj | |≤1, where | Si | is the chromatic number of the color. The minimum number of colors required for an equitable proper total-coloring. A simple graph G is denoted by Xet(G). In this paper, we prove theorems of equitable total coloring of multiple join-graph and get equitable total chromatic numbers of some special multiple join-graph.