摘要
提出了图的邻点可区别Ⅰ-均匀全染色的概念,研究了它的一些性质,并给出了路、圈、扇、轮、完全图、完全二部图等的邻点可区别Ⅰ-均匀全色数.进而提出了图的邻点可区别Ⅰ-均匀全色数都不会超过△+2的猜想.
The concept of incidence-adjacent vertex distinguishing equitable total coloring of a graph is proposed. Some properties of the incidence-adjacent vertex distinguishing equi- table total coloring of graphs are discussed and the incidence-adjacent vertex distinguishing equitable total chromatic numbers of some graphs, such as path, cycle, fan, wheel, complete graph, complete bipartite graph, and so on are investigated. And a conjecture is given by us which the incidence-adjacent vertex distinguishing equitable total chromatic number of a graph is no more than A＋2.
出处
《应用数学学报》
CSCD
北大核心
2015年第1期125-136,共12页
Acta Mathematicae Applicatae Sinica
基金
国家自然科学基金(61170302)
连云港市第五期"521高层次人才培养工程"培养对象资助项目
关键词
邻点可区别I-全染色
邻点可区别I-均匀全染色
邻点可区别I-均匀全色数
incidence-adjacent vertex distinguishing total coloring
incidence-adjacent vertex distinguishing equitable total coloring
incidence-adjacent vertex distinguishing equitable total chromatic number
