2-distance sum distinguishing edge colorings of three types of join graphs
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.
edge coloring2-distance sum distinguishing edge coloringjoin graphs
万方数据
维普
