On the vertex-distinguishing edge chromatic number of P_m V W_n
Ma Gang · Journal of Lanzhou University · 2007
A proper edge-coloring is called vertex-distinguishing if every two vertices are incident to edge with vertex.The minimum number of colors is required for a vertex-distinguishing proper edge-coloring.In this paper,we have given the vertex-distinguishing edge chromatic number of path and wheel join-graph.