摘要
该文探讨了C_(m)·P_(n)、C_(m)·S_(n)和C_(m)·K_(n)三类联图的2-距离和可区别边染色问题.根据联图的结构特点,利用组合分析法、反证法以及分类讨论思想,得到了这三类联图的2-距离和可区别边色数.结论表明三类联图的2-距离和可区别边色数均不超过Δ+2.
To further explore the problem of the 2-distance sum distinguishing edge coloring of three types of join graphs including C_(m)·P_(n),C_(m)·S_(n)and C_(m)·K_(n).By using the methods of combinatorial analysis,reduction to absurdity and categorical discussion,the 2-distance sum distinguishing edge chromatic numbers of C_(m)·P_(n),C_(m)·S_(n)and C_(m)·K_(n)are determined,respectively.It is proved that the 2-distance sum distinguishing edge chromatic numbers for the above join graphs are not more thanΔ+2.
作者
王芹
杨超
殷志祥
姚兵
WANG Qin;YANG Chao;YIN Zhixiang;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
CSCD
北大核心
2024年第2期178-183,共6页
Journal of Central China Normal University：Natural Sciences
基金
国家自然科学基金项目(61672001,61662066,62072296)。
关键词
边染色
2-距离和可区别边染色
联图
edge coloring
2-distance sum distinguishing edge coloring
join graphs
