摘要
对一个正常的全染色满足各种颜色所染元素数(点或边)相差不超过1时,称为均匀全染色,其所用最少染色数称为均匀全色数.就轮Wm与星Sn的联图Wm∨Sn,得到了在m,n不同取值情况下的均匀全色数.
A total-coloring is called equitable if ｜｜Ti｜-｜Ti｜｜≤1, where ｜Ti｜ is chromatic number of the i coloer. The minimum number of colors required for an equitable proper total-coloring of a simple graph G is denoted by Xet （G）. In this paper, we have given the equitable total chromatic number of Wm ∨ Sn in the case that rn and n are distint.
出处
《数学研究》
CSCD
2007年第3期338-342,共5页
Journal of Mathematical Study
基金
国家自然科学基金资助项目(40301037)
国家民委科研项目(05XB07)
关键词
轮
星
联图
均匀全色数
Wheel
Star
Join-graph
Equitable total chromatic number
