On the Vertex-distinguishing Edge Chromatic Number of P_m∨F_n
Xinsheng Liu · Journal of Gansu Sciences · 2008
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.We have given the vertex-distinguishing edge chromatic number of path and fan join-graph.