Abstract
The idea of supera,0-edge-antimagic labeling of graphs had been introduced by Enomoto et al. in the late nineties. This article addresses supera,0-edge-antimagic labeling of a biparametric family of pancyclic graphs. We also present the aforesaid labeling on the disjoint union of graphs comprising upon copies ofC4and different trees. Several problems shall also be addressed in this article.
Highlights
A graph Γ(V, E) is a combination of two different sets, one is the set of vertices V(Γ) and the other is the set of connections between these vertices, termed as set of edges E(Γ)
Ringel and Hartsfield capitulated the idea of antimagic labeling with respect to vertex
Sums of graphs in [3]. e idea of magic valuations of graphs had been brought by Kotzig and Rosa [4] which was the graphs’ (a, 0) − EAMT labeling
Summary
A graph Γ(V, E) is a combination of two different sets, one is the set of vertices V(Γ) and the other is the set of connections between these vertices, termed as set of edges E(Γ). E nonempty and simple graphs shall be considered here only all the way, consisting of V(Γ), the set of vertices, and E(Γ), the set of edges, having |V(Γ)| p and |E(Γ)| q. In this case, the graph Γ is called a (p, q)-graph. If the labeling covers V(Γ) or E(Γ) only in the domain, it is termed to be the vertex or edge labeling, respectively. E equal or unequal edge/vertex weights point towards, respectively, the magic and antimagic types of labeling. Ringel and Hartsfield capitulated the idea of antimagic labeling with respect to vertex-
Sign-in/Register to view highlights & summary 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.
