D(2)-vertex distinguishing general edge colorings of graphs
Yao Bing · 2013
The concept of D(β)-vertex distinguishing general edge coloring is introduced and the case whenβ= 2 is discussed.D(2)-vertex distinguishing general edge chromatic numbers of path, cycle,star,double star,fan and wheel are obtained and the D(2)-vertex distinguishing general edge chromatic numbers of graphs with 2-distance chromatic number 3 or 4 are investigated in this paper. The D(2)-vertex distinguishing general edge colorings of graphs with stable 2-distance 4-colorings are studied.One conjecture and one open problem are proposed in this paper.