Generation of Anti-Magic Graphs
Main Article Content
Abstract
An anti-magic labeling of a graph G is a one-to-one correspondence between E(G) and {1, 2, · · ·, |E|} such that the vertex-sum for distinct vertices are different. Vertex-sum of a vertex u ∈ V(G) is the sum of labels assigned to edges incident to the vertex u. In this paper, we prove that the splittance of an anti-magic graph admits anti-magic labeling. It was conjectured by Hartsfield and Ringel that every tree other than K2 has an anti-magic labeling. In this paper, we prove that there exists infinitely many trees that are anti-magic.
Article Details
References
- N. Alon, G. Kaplan, A. Lev, Y. Roditty, R. Yuster, Dense Graphs Are Antimagic, J. Graph Theory 47 (2004), 297–309. https://doi.org/10.1002/jgt.20027.
- D.W. Cranston, Y. Liang, X. Zhu, Regular Graphs of Odd Degree Are Antimagic, J. Graph Theory 80 (2015), 28–33. https://doi.org/10.1002/jgt.21836.
- J.A. Gallian, A Dynamic Survey of Graph Labeling, Electron. J. Combin. 2019 (2019), #DS6.
- N. Hartsfield, G. Ringel, Pearls in Graph Theory: A Comprehensive Introduction, Revised and Augmented, Academic press, 1994.
- G. Kaplan, A. Lev, Y. Roditty, On Zero-Sum Partitions and Anti-Magic Trees, Discr. Math. 309 (2009), 2010–2014. https://doi.org/10.1016/j.disc.2008.04.012.
- Y.-C. Liang, X. Zhu, Antimagic Labeling of Cubic Graphs: Antimagic Labeling of Cubic Graphs, J. Graph Theory 75 (2014), 31–36. https://doi.org/10.1002/jgt.21718.
- Y.-C. Liang, T.-L. Wong, X. Zhu, Anti-Magic Labeling of Trees, Discr. Math. 331 (2014), 9–14. https://doi.org/10.1016/j.disc.2014.04.021.
- E. Sampathkumar, H.B. Walikar, On the Splitting Graph of a Graph, Karnatak Univ. Sci. 25 (1980), 13-16.
- J. Shang, Spiders Are Antimagic, Ars Combin. 118 (2015), 367-372.
- D.B. West, Introduction to Graph Theory, 2nd ed, Prentice Hall, Upper Saddle River, 2001.