摘要
根据图Cm∨Cn(m≠n)的结构特征,分n≥m+3和n<m+3两种情况讨论了这类图的邻点可区别均匀I-全染色问题.通过函数构造法,确定了Cm∨Cn(m≠n)的邻点可区别的均匀I-全色数,并验证了AVDETC猜想对于这类图是成立的.
According to the structural characteristics of the graph Cm∨Cn(m≠n),the incidence-adjacent vertex distinguishing equitable total coloring of the join graph of two cycles are discussed in n≥m+3 and n<m+3 cases.By function construction methods,the incidence-adjacent vertex distinguishing equitable total chromatic number of graph Cm∨Cn(m≠n)are detremined,and the AVDETC conjecture is valid for this kinds of graph.
作者
张婷
朱恩强
赵慧霞
ZHANG Ting;ZHU En-qiang;ZHAO Hui-xia(Normal School,Lanzhou University of Arts and Science,Lanzhou 730010,China;Institute of Computing Science and Technology,Guangzhou University,Guangzhou 510006,China;Journal Editorial Department,Lanzhou University of Arts and Science,Lanzhou 730010,China)
出处
《数学的实践与认识》
北大核心
2020年第20期293-298,共6页
Mathematics in Practice and Theory
基金
甘肃省高等学校创新能力提升项目(2019B—195)
国家自然科学基金(61872101)。
关键词
联图
邻点可区别均匀I-全染色
邻点可区别均匀I-全色数
Join graph
incidence-adjacent vertex distinguishing equitable total coloring
incidence-adjacent vertex distinguishing equitable total chromatic number
