摘要
为了进一步研究图的2-距离和可区别边染色的问题.利用组合分析法、反证法以及分类讨论的思想,得到了路、圈、C_(n)∧P_(m)、C_(m)∧C_(n)、C_(n)∧P_(m)∧C_(k)等5类平方图的2-距离和可区别边色数,结果表明这5类平方图的2-距离和可区别边色数均不超过Δ+2.
This paper is to further study the problem of the 2-distance sum distinguishing edge coloring of graphs.By using the methods of combinatorial analysis,reduction to absurdity and categorical discussion,the 2-distance sum distinguishing edge chromatic numbers of five types of square graphs including paths,cycles,C_(n)∧P_(m),C_(m)∧C_(n) and C_(n)∧P_(m)∧C_(k) are determined,respectively.The above results implies that the 2-distance sum distinguishing edge chromatic numbers are no more thanΔ+2.
作者
王芹
杨超
姚兵
Wang Qin;Yang Chao;Yao Bing(School of Mathematics,Physics and Statistics,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
北大核心
2023年第4期78-83,共6页
Journal of Henan Normal University(Natural Science Edition)
基金
国家自然科学基金(61672001,61662066,62072296).
关键词
边染色
2-距离和可区别边染色
平方图
edge coloring
2-distance sum distinguishing edge coloring
square graphs
