TITLE:
The Equitable Total Chromatic Number of Some Join graphs
AUTHORS:
Gang MA, Ming MA
KEYWORDS:
join graph; equitable total coloring; equitable total chromatic numbers
JOURNAL NAME:
Open Journal of Applied Sciences,
Vol.2 No.4B,
January
15,
2013
ABSTRACT: A proper total-coloring of graph G is said to beequitable if the number of elements (vertices and edges) in anytwo color classes differ by at most one, which the requiredminimum number of colors is called the equitable total chromaticnumber. In this paper, we prove some theorems on equitabletotal coloring and derive the equitable total chromatic numbersof Pm VSn, Pm VFn and Pm V Wn.