摘要
对一个正常的全染色满足各种颜色所染元素数(点或边)相差不超过1时,称为均匀全染色,其所用最少染色数称为均匀全色数。本研究得到了G∨H的均匀全色数为它的阶,若满足以下条件之一:(1)当G的最大度等于它的阶减1,且G∨H的顶点数为奇数;(2)当G只有一个最大度点,且最大度等于它的阶减1,且H的最大度不大于它的阶减2,还得到了当G与H的最大度都分别不超过各自的阶减2时,G∨H的均匀全色数的一个上界。
In this paper,the equitable total chromatic number of G∨H is its order when it belongs to one of the following two cases:(1) the maximum degree of G equals its order minus one,and the order of G∨H is odd.(2) or,G only has one vertex with maximum degree,which is its order minus one,and the maximum degree of H is less than or equal to its order minus two.Furthermore,a upper bound of the G∨H equitable total chromatic number is got if the maximum degree of G and H is less than or equal to its order minus two,respectively.
出处
《河南科技大学学报（自然科学版）》
CAS
2006年第6期90-92,共3页
Journal of Henan University of Science And Technology:Natural Science
基金
国家自然科学基金项目(19871036)
国家民委科研项目(05XB07)
关键词
联图
均匀全染色
均匀全色数
Join-graph
Equitable total coloring
Equitable total chromatic number
