Abstract
A labeling of a graph is a mapping that carries some set of graph elements into numbers (usually positive integers). An ( a , d ) - edge-antimagic total labeling of a graph with p vertices and q edges is a one-to-one mapping that takes the vertices and edges onto the integers 1 , 2 … , p + q , so that the sum of the labels on the edges and the labels of their end vertices forms an arithmetic progression starting at a and having difference d . Such a labeling is called super if the p smallest possible labels appear at the vertices. In this paper we prove that every even regular graph and every odd regular graph with a 1-factor are super ( a , 1 ) -edge-antimagic total. We also introduce some constructions of non-regular super ( a , 1 ) -edge-antimagic total 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.
