Abstract
An (a, d)-edge-antimagic total labeling of a graph G with p vertices and q edges is a bijection f from the set of all vertices and edges to the set of positive integers {1,2,3,…,p+q} such that all the edge-weights w(uv)=f(u)+f(v)+f(uv); uv∈E(G), form an arithmetic progression starting from a and having common difference d. An (a, d)-edge-antimagic total labeling is called a super (a, d)-edge-antimagic total labeling ((a, d)-SEAMT labeling) if f(V(G))={1,2,3,…,p}. In this paper we investigate the existence of super (a, d)-edge antimagic total labeling for friendship graphs and generalized friendship graphs.
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.
