Abstract
An antimagic labeling of a simple graph [Formula: see text] is a bijection [Formula: see text] such that [Formula: see text] for any two vertices [Formula: see text] in [Formula: see text]. We survey the results about antimagic labelings and other labelings motivated by antimagic labelings of graphs, and present some conjectures and open questions.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
