Abstract
For a proper [Formula: see text]-edge coloring [Formula: see text] of a graph [Formula: see text], let [Formula: see text] denote the sum of the colors taken on the edges incident to the vertex [Formula: see text]. Given a positive integer [Formula: see text], the [Formula: see text]-neighbor sum distinguishing [Formula: see text]-edge coloring of G is [Formula: see text] such that for each edge [Formula: see text], [Formula: see text]. We denote the smallest integer [Formula: see text] in such coloring of [Formula: see text] by [Formula: see text]. For [Formula: see text], Wang et al. proved that [Formula: see text]. In this paper, we show that if G is a planar graph without isolated edges, then [Formula: see text], where [Formula: see text].
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.
