关于联图W_m∨P_n的均匀全染色

On Equitable Total-Coloring of W_m∨P_n

对一个正常的全染色满足各种颜色所染元素数(点或边)相差不超过1时,称为均匀全染色,其所用最少染色数称为均匀全色数.就轮Wm与路Pn的联图Wm∨Pn,得到了在m,n不同取值情况下的均匀全色数.

A total-coloring is called equitable if││Si│-│Sj││≤1.the│Si│ is called chromatic number ofthe i color. The minimum number of colors required for an equitable proper total-coloring, a simple graph G is denoted by χet, （G）.In this paper, we have given the equitable total chromatic number of Wm∨Pn