Abstract
AbstractAn antimagic labeling of a graph with m edges and n vertices is a bijection from the set of edges to the integers such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with the same vertex. A graph is called antimagic if it has an antimagic labeling. In this article, we discuss antimagic properties of graphs that contain vertices of large degree. We also show that graphs with maximum degree at least are antimagic.
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
