Wenhui Xu
Abstract
A proper edge-coloring is called vertex-distinguishing if any two vertics are incident to edge with vertex.The minimum number of color is required for a vertex-distinguishing proper edge-coloring.In this paper,we have given the vertex-distinguishing edge chromatic number of cycle and wheel join-graph.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A proper edge-coloring is called vertex-distinguishing if any two vertics are incident to edge with vertex.The minimum number of color is required for a vertex-distinguishing proper edge-coloring.In this paper,we have given the vertex-distinguishing edge chromatic number of cycle and wheel join-graph.
Key concepts: Vertex (graph theory), Combinatorics, Chromatic scale, Neighbourhood (mathematics), Mathematics, Edge coloring, Graph, Enhanced Data Rates for GSM Evolution