摘要
对一个正常的全染色满足各种颜色所染元素数(点或边)相差不超过1时,称为均匀全染色,其所用最少染色数称为均匀全色数.就扇与轮的联图Fm ∨ Wn,得到了在m,n不同取值情况下的均匀全色数.
A total-coloring is called equitable if ｜｜Ti｜-｜Tj｜｜≤1,the ｜Ti｜is called chromatic num-ber of the/color. The minimum number of colors required for an equitable proper total-coloring, a simple graph G is denoted by Xa（G） . In this paper, we have given the equitable total chromatic number of Fm ∨ Wn.
出处
《青海师范大学学报（自然科学版）》
2012年第1期27-30,共4页
Journal of Qinghai Normal University(Natural Science Edition)
关键词
联图
均匀全染色
均匀全色数
oin-graph
equitable total coloring
equitable total chromatic number
