摘要
为了进一步研究图的2-距离和可区别全染色问题,根据中间图的构造特点,通过构造染色函数,利用组合分析法得到了路,圈,星,扇,轮,双星以及轮环图的中间图的2-距离和可区别全色数.
To further study the problem of 2-distance sum distinguishing total coloring,according to the structural properties of middle graphs,by constructing coloring functions and taking advantage of the methods of combinatorial analysis,the 2-distance sum distinguishing total chromatic numbers for middle graphs of path,cycle,star,fan,wheel,double star and wheel-ring graph are obtained.
作者
王同昕
杨超
姚兵
WANG Tong-xin;YANG Chao;YAO Bing(School of Mathematics,Physics and Statistics,Shanghai University of Engineering Science,Shanghai 201620,China;Center of Intelligent Computing and Applied Statistics,Shanghai University of Engineering Science,Shanghai 201620,China;College of Mathematics and Statistics,Northwest Normal University,Lanzhou 730070,China)
出处
《兰州理工大学学报》
CAS
北大核心
2024年第3期156-161,共6页
Journal of Lanzhou University of Technology
基金
国家自然科学基金(61672001,61662066,62072296)。
关键词
全染色
2-距离和可区别全染色
中间图
total coloring
2-distance sum distinguishing total coloring
middle graphs
