Abstract
Hartsfeld and Ringel in 1990 introduced the concept of an antimagic labeling of a graph, that is, a vertex antimagic edge labeling and they also conjectured that every connected graph, except K2, is antimagic. As a means of providing an incremental advance towards proving the conjecture of Hartsfield and Ringel, in this paper we provide constructions whereby, given any degree sequence pertaining to a tree, we can construct two different vertex antimagic edge trees with the given degree sequence. Moreover, we modify a construction presented for trees to obtain an antimagic unicyclic graph with a given degree sequence pertaining to a unicyclic 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 callMore From: AKCE International Journal of Graphs and Combinatorics
Disclaimer: 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.
