2009•Journal of Suzhou University of Science and TechnologyRequires access
On the Vertex-distinguishing Edge Chromatic Number of S_m∨W_n
Yang Yang
Open publisher page 0 citations
Abstract
The edge-coloring of a graph is called vertex-distinguishing if every two vertices are incident to edge with vertex.The minimum number of colors it requires is called the vertex-distinguishing edge chromatic number of that graph.In this paper,we have obtained the vertex-distinguishing edge chromatic number of Sm∨Wn.