Ma Gang
Abstract
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.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
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 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.
Key concepts: Combinatorics, Vertex (graph theory), Chromatic scale, Mathematics, Neighbourhood (mathematics), Edge coloring, Fractional coloring, Edge cover