Abstract
A (proper) total [k]-coloring of a graph G is a mapping ϕ:V(G)∪E(G)→[k]={1,2,…,k} such that any two adjacent elements in V(G)∪E(G) receive different colors. Let f(v) denote the sum of the color of a vertex v and the colors of all incident edges of v. A total [k]-neighbor sum distinguishing-coloring of G is a total [k]-coloring of G such that for each edge uv∈E(G), f(u)≠f(v). By χnsd″(G), we denote the smallest value k in such a coloring of G. In this paper, we show that if G is a planar graph with Δ(G)≥14, then χnsd″(G)≤Δ(G)+2.
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.
