图的距离不大于β的任意两点可区别的边染色

D(β)-Vertex-Distinguishing Proper Edge-Coloring of Graphs

本文提出了图的距离不大于β的任意两点可区别的边染色,即D(β)-点可区别的边染色(简记为D(β)-VDPEC)．并得到了一些特殊图类,如圈、完全图、完全二部图、扇、轮、树以及一些联图的D(β)-点可区别的边色数,文后提出了相关的猜想．

In this paper, we present a new concept of the D（β）-vertex-distinguishing proper edge-coloring of graphs （briefly, D（β）-VDPEC of graphs） and, meanwhile, have obtained the D（β）-VDPEC chromatic number on some families of graphs such as cycles,complete graphs, complete bipartite graphs, fans, wheels, trees conjecture is proposed.