摘要
讨论了路图Pn的Myceilski图M(Pn)和二幂图P22的邻点可区别I-均匀全染色问题,根据这些图的结构性质,在运用构造法的基础上,通过色的调整给出它们的邻点可区别I-均匀全染色方法,从而有效地确定了其邻点可区别I-均匀全色数.结果说明了AVDETC猜想对于这两类图是成立的.
In this paper,The incidence-adjacent vertex distinguishing equitable total coloring of the Myceilski graph M(Pn)and the two power graph Pn^2 of path are discussed.The incidence-adjacent vertex distinguishing equitable total chromatic numbers of M(Pn)and Pn^2 are confirmed efficiently by using the method of constructing and color adjusting technique based on the structure quality of the graphs,for which the AVDETC conjecture is valid.
作者
王继顺
左林
葛仁福
WANG Ji-shun;ZUO Lin;GE Ren-fu(School of Mathematics and Information Engineering,Lianyungang Normal College,Lianyungang 222006,China;Department of Basic Course,Lianyungang Technical College,Lianyungang 222006,China)
出处
《数学的实践与认识》
北大核心
2020年第15期104-109,共6页
Mathematics in Practice and Theory
基金
江苏省高等教育科学研究“十三五”规划课题资助(16YB091)
连云港师范高等专科学校校科研课题资助(LYGSZ19038)
连云港师范高等专科学校2019年校高级别科研培育拟立项课题资助(LSZGJB201903)。
关键词
Myceilski图
幂图
邻点可区别Ⅰ-均匀全染色
邻点可区别Ⅰ-均匀全色数
Myceilski graph
power graph
incidence-adjacent vertex distinguishing equitable total coloring
incidence-adjacent vertex distinguishing equitable total chromatic number
