2-distance sum distinguishing edge colorings of three types of join graphs
WANG Qin1， YANG Chao1， YIN Zhixiang1， YAO Bing2
(1.School of Mathematics， Physics and Statistics， Center of Intelligent Computing and Applied Statistics， Shanghai University of Engineering Science， Shanghai 201620， China；2.College of Mathematics and Statistics， Northwest Normal University， Lanzhou 730070， China)
Abstract：To further explore the problem of the 2-distance sum distinguishing edge coloring of three types of join graphs including Cm·Pn， Cm·Sn and Cm·Kn. By using the methods of combinatorial analysis， reduction to absurdity and categorical discussion， the 2-distance sum distinguishing edge chromatic numbers of Cm·Pn， Cm·Sn and Cm·Kn 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.
2024, Vol. 58 
