A Study of Anti-Magic Graphs on Corona Product of Complete Graphs and Complete Bipartite Graphs

Authors

DOI:

https://doi.org/10.26713/cma.v13i5.1871

Keywords:

Complete graph, Complete bipartite graph, Corona product, Anti-magic labeling

Abstract

Graph labeling has a wide range of applications such as coding theory, X-ray crystallography, network design, and circuit design. It can be done by assigning numbers to edges, vertices or to both. An anti-magic labeling of a graph G is a one-to-one correspondence between the edge set E(G) and the set {1,2,3,,|E|} such that the vertex sums are pairwise distinct. The vertex sum is the sum of labels assigned to edges incident to a vertex. Corona product of the graphs H and T is the graph HT which is obtained by taking one copy of H and |V(H)| copies of T and making the ith vertex of H adjacent to every vertex of the $i$th copy of T, 1i|V(H)|. In this study, we prove that the Corona product KnKm,m generates anti-magic graphs. We also develop a programme using Matlab to demonstrate this anti-magic property.

Downloads

References

N. Alon, G. Kaplan, A. Lev, Y. Roditty and R. Yuster, Dense graphs are antimagic, Journal of Graph Theory 47(4) (2004), 297 – 309, DOI: 10.1002/jgt.20027.

K. Bérczi, A. Bernáth and M. Vizer, Regular graphs are antimagic, The Electronic Journal of Combinatorics 22(3) (2015), 1 – 14, DOI: 10.37236/5465.

R. Frucht and F. Harary, On the corona of two graphs, Aequationes Mathematicae 4(3) (1970), 322 – 325, DOI: 10.1007/BF01844162.

J. A. Gallian, A dynamic survey of graph labeling (Graph labelling), The Electronic Journal of Combinatorics DS6 (2022), 1 – 623, DOI: 10.37236/27.

N. Hartsfield and G. Ringel, Pearls in Graph Theory: A Comprehensive Introduction, Dover Publications Inc., USA (2003), DOI: 10.2307/2324291.

Y.-C. Liang, T.-L. Wong and X. Zhu, Anti-magic labeling of trees, Discrete Mathematics 331 (2014), 9 – 14, DOI: 10.1016/j.disc.2014.04.021.

W. Ma, G. Dong, Y. Lu and N. Wang, Lexicographic product graphs Pm [Pn] are antimagic, AKCE International Journal of Graphs and Combinatorics 15(3) (2018), 271 – 283, DOI: 10.1016/j.akcej.2017.10.005.

S. Nada, A. Elrokh, E. A. Elsakhawi and D. E. Sabra, The corona between cycles and paths, Journal of the Egyptian Mathematical Society 25(2) (2017), 111 – 118, DOI: 10.1016/j.joems.2016.08.004.

K. V. Reddy, A. M. Reddy and K. Rajyalakshmi, Splittance of cycles are anti-magic, Advances in Mathematics: Scientific Journal 9(9) (2020), 7165 – 7170, DOI: 10.37418/amsj.9.9.66.

T.-M. Wang and C.-C. Hsiao, On anti-magic labeling for graph products, Discrete Mathematics 308(16) (2008), 3624 – 3633, DOI: 10.1016/J.DISC.2007.07.027.

Downloads

Published

30-12-2022

How to Cite

Muya, J. G., & Shobhalatha, G. (2022). A Study of Anti-Magic Graphs on Corona Product of Complete Graphs and Complete Bipartite Graphs. Communications in Mathematics and Applications, 13(5), 1337–1345. https://doi.org/10.26713/cma.v13i5.1871

Issue

Section

Research Article