Abstract
Let G be a nontrivial and connected graph of order n. Define a bijection function g : V(G) → {1, 2,…, n}. For any vertex v ∈ V(G), the neighbor sum g(v) + Σu∈N(v)g(u) is a called the weight of the vertices v, denoted by w(v). If w(x) ≠ w(y) for any two distinct vertices x and y, then g is called an inclusive distance antimagic labeling. In this paper, we present several results on inclusive distance antimagic labeling of graphs namely joint product, friendship, complete graph, path graph, cyle graph, star graph, doubel star, broom and wheel graph.
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.
