Abstract
A neighbor sum distinguishing edge-k-coloring, or nsd-k-coloring for short, of a graph G is a proper edge coloring of G with elements from {1,2,…,k} such that no pair of adjacent vertices meets the same sum of colors of G. The definition of this coloring makes sense for graphs containing no isolated edges (we call such graphs normal). Let mad(G) and Δ(G) be the maximum average degree and the maximum degree of a graph G, respectively. In this paper, we prove that every normal graph with Δ(G)≥5 and mad(G)<3 admits an nsd-(Δ(G)+2)-coloring. Our approach is based on the Combinatorial Nullstellensatz and the discharging method.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
