Antimagic labeling of Triangular book graph and double fan graph ∗
DOI:
https://doi.org/10.48165/bpas.2023.42E.1.3Keywords:
Antimagic labeling, Triangular book graph, Double fan graphAbstract
In 1990, Hartsfield and Ringel (N. Hartsfield and G. Ringel, Pearls in Graph Theory, Academic Press, San Diego, 1990) introduced the concept of antimagic labeling. Antimagic labeling of a graph G is a one-one correspondence between G and {1, 2, . . . , |E|} such that the sums of labels assigned to the edges incident to distinct ver tices are different. In this paper we prove that triangular book graph and double fan graph admit antimagic labeling.
References
Alon, N., Kaplan, G., Lev, A., Roditty, Y. and Yuster, R. (2004): Dense graphs are antimagic, Journal of Graph Theory, 47(4) ,297–309.
Chang, F., Liang, Y. C., Pan, Z. and Zhu, X. (2016). Antimagic labeling of regular graphs, Journal of Graph Theory, 82, 339–334.
Cranston, D. W., Liang, Y. C. and Zhu, X. (2015). Regular graphs of odd degree are antimagic, Journal of Graph Theory, 80, 28–33.
Gallian, J. A. (2022). A dynamic survey of graph labeling, The Electronic Journal of Combina torics, # DS6.
Hartsfield, N. and Ringel, G. (1990). Pearls in Graph Theory, Academic Press, San Diego. [6] Rosa, A. (1967). On certain valuations of the vertices of a graph, Theory of Graphs, (International Symposium, Rome), Gordon and Breach N.Y. and Dunod Paris, 349–355.