Abstract

A proper edge coloring is neighbor-distinguishing if any two adjacent vertices have distinct sets consisting of colors of their incident edges. The minimum number of colors needed for a neighbor-distinguishing edge coloring is the neighbor-distinguishing index, denoted by χa′(G). A graph is normal if it contains no isolated edges. Let G be a normal graph, and let Δ(G) and χ′(G) denote the maximum degree and the chromatic index of G, respectively. We modify the previously known techniques of edge-partitioning to prove that χa′(G)≤2χ′(G), which implies that χa′(G)≤2Δ(G)+2. This improves the result in Wang et al. (2015), which states that χa′(G)≤52Δ(G) for any normal graph. We also prove that χa′(G)≤2Δ(G) when Δ(G)=2k, k is an integer with k≥2.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.