On the Equitable Total Colorings of Sm V Pn V Pn
Tian Jing-jing · 2010
The equitable total chromatic number of a graph G is the smallest integer k for which G has a k-total coloring such that the number of vertices and edges colored with each color differs by at most one. In this paper , the equitable total coloring of SmV PnV Pnhas been studied and the equitable total chromatic number of SmV PnV Pnhas been obtained.