Pushpa Publishing House

Journal Menu

Content

Volume 42 (2025)

	Volume 42, Issue 6 Pg 515 - 620 (August 2025)
	Volume 42, Issue 5 Pg 415 - 514 (July 2025)
	Volume 42, Issue 4 Pg 303 - 414 (May 2025)
	Volume 42, Issue 3 Pg 191 - 302 (April 2025)
	Volume 42, Issue 2 Pg 89 - 190 (February 2025)
	Volume 42, Issue 1 Pg 1 - 88 (January 2025)

Volume 41 (2024)

Volume 40 (2023)

Volume 39 (2023)

Volume 38 (2023)

Volume 29 (2022)

Volume 28 (2021)

Volume 27 (2021)

Volume 26 (2021)

Volume 25 (2020)

Volume 24 (2020)

Volume 23 (2020)

Volume 22 (2019)

Volume 21 (2019)

Volume 20 (2019)

Volume 19 (2018)

Volume 18 (2017)

Volume 17 (2016)

Volume 16 (2015)

Volume 15 (2015)

Volume 14 (2014)

Volume 13 (2014)

Volume 12 (2013)

Volume 11 (2013)

Volume 10 (2012)

Volume 7 (2011)

Volume 6 (2010)

Volume 5 (2010)

Volume 4 (2009)

Volume 3 (2009)

Volume 2 (2008)

Volume 1 (2008)

Important: All future articles and volumes will be published only on our new website: www.pphmjopenaccess.com. Authors are requested to submit their papers through the new website only. Visit now: www.pphmjopenaccess.com

Advances and Applications in Discrete Mathematics

Advances and Applications in Discrete Mathematics
Volume 42, Issue 5, Pages 423 - 443 (July 2025)
http://dx.doi.org/10.17654/0974165825028

k-MAGIC VERTEX LABELING WITH GROUP ELEMENTS

K. Easwaran, M. Kamaraj and A. David Christopher

Abstract:

Let A be a finite abelian group. Let G be simple graph with vertices. By labeling of vertex set V(G) we mean a one-to-one function A weight function is a function where i = 1, 2. In this article, we consider the following two weight functions:

and

The graph G is said to be graph if the cardinality of the set is k. The results of this paper ascertain some well-known classes of graphs to be for specific instances of A and k.

Keywords and phrases:

vertex labelling, weight function, k-magic vertex labeling, Abelian group, cyclic group, subgroup, coset

Received: April 6, 2025; Revised: April 14, 2025; Accepted: May 16, 2025; Published: May 23, 2025

How to cite this article: K. Easwaran, M. Kamaraj and A. David Christopher, k-magic vertex labeling with group elements, Advances and Applications in Discrete Mathematics 42(5) (2025), 423-443. https://doi.org/10.17654/0974165825028

This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License

References:

[1]Alison Marr, N. C. K. Phillips and W. D. Wallis, Bimagic labelings, AKCE International Journal of Graphs and Combinatorics 6(1) (2009), 155-160.

[2]S. Arumugam and N. Kamatchi, On -distance antimagic graphs, Australasian Journal of Combinatorics 54 (2012), 279-287.

[3]M. Baca, Y. Lin, M. Miller and R. Simanjuntak, New constructions of magic and antimagic graph labelings, Utilitas Math. 60 (2001), 229-239.

[4]M. Baca, E. T. Baskoro, M. Miller, J. Ryan, R. Simanjuntak and K. A. Sugeng, Survey of edge antimagic labelings of graphs, J. Indones. Math. Soc. 12(1) (2006), 113-130.

[5]M. Baca, Y. Lin, M. Miller and M. Z. Youssef, Edge-antimagic graphs, Discrete Mathematics 307 (2007), 1232-1244.

[6]M. Baca, F. Bertault, J. A. MacDougall, M. Miller, R. Simanjuntak and Slamin, Vertex-antimagic total labelings of graphs, Discussiones Mathematicae Graph Theory 23 (2003), 67-83.

[7]E. Bala and K. Thirusangu, On bi-magic labeling of 4-regular graphs, Indian Journal of Science and Technology 4(4) (2011), 414-416.

[8]S. Balamoorthy, S. V. Bharanedhar and N. Kamatchi, On the products of group vertex magic graphs, AKCE International Journal of Graphs and Combinatorics 19(3) (2022), 268-275.

[9]S. Balamoorthy, A-vertex magicness of product of graphs, AKCE International Journal of Graphs and Combinatorics 0(0) (2024), 1-7.

[10]M. Basher, Group vertex magic labeling of some special graphs, Proyecciones Journal of Mathematics 43(1) (2024), 119-131.

[11]S. Cichacz, D. Froncek, K. Sugeng and Sanming Zhou, Group distance magic and antimagic graphs, Acta. Math. Sin.-English Ser. 32 (2016), 1159-1176.

https://doi.org/10.1007/s10114-016-4646-9.

[12]D. Combe, A. M. Nelson and W. D. Palmer, Magic labellings of graphs over finite abelian groups, Australasian Journal of Combinatorics 29 (2004), 259-271.

[13]Dalibor Froncek, Group distance magic labeling of cartesian product of cycles, Australasian Journal of Combinatorics 55 (2013), 167-174.

[14]I. Gray and J. MacDougall, Vertex-magic labeling of regular graphs: Disjoint unions and assemblages, Discrete Applied Mathematics 160(7-8) (2012), 1114-1125. https://doi.org/10.1016/j.dam.2011.11.025.

[15]N. Hartsfield and G. Ringel, Pearls in Graph Theory, Academic Press, INC, Boston, 1990, pp. 108-109.

[16]A. Joseph, Gallian graph labeling, Electronic Journal of Combinatorics, Dynamic Survey 6 (2023), 134-248. https://doi.org/10.37236/27.

[17]N. Kamatchi, K. Paramasivam, A. V. Prajeesh, K. Muhammed Sabeel and S. Arumugam, On group vertex magic graphs, AKCE International Journal of Graphs and Combinatorics 17(1) (2020), 461-465.

[18]A. Kotzig and A. Rosa, Magic valuations of finite graphs, Canad. Math. Bull. 13 (1970), 451-461.

[19]Štefko Miklavič, and Primož Šparl, On distance magic labelings of hamming graphs and folded hypercubes, Discussiones Mathematicae Graph Theory 44 (2024), 17-23. https://doi.org/10.7151/dmgt.

[20]Mirka Miller, Chris Rodger and Rinovia Simanjuntak, Distance magic labelings of graphs, Australasian Journal of Combinatorics 28 (2003), 305-315.

[21]Muhammad Husnul Khuluq, Vira Hari Krisnawati and Noor Hidayat, On group- vertex-magic labeling of simple graphs, CAUCHY-Journal Mathematika Murni dan Aplikasi 8(2) (2023), 167-174.

[22]D. Prathap and Aryaman Bansal, On bi-magic labelings of certain graphs involving cycles, Journal of Data Acquisition and Processing 38(2) (2023), 2975-2982.

[23]Risma Yulina Wulandari and Rinovia Simanjuntak, Distance antimagic labelings of product graphs, Electronic Journal of Graph Theory and Applications 11 (2023), 111-123.

[24]Ksenija Rozman and Primoz Sparl, Distance magic labelings of Cartesian products of cycles, 2024. https://doi.org/10.48550/arXiv.2403.03279.

[25]M. Sabeel, K. Paramasivam, A. V. Prajeesh, N. Kamatchi and S. Arumugam, A characterization of group vertex magic trees of diameter up to 5, Australasian Journal of Combinatorics 85(1) (2023), 49-60.

[26]J. Sedlacek, Problem 27. Theory of graphs and its applications (Smolenice, 1963), 163-164, (Publ. House Czechoslovak Acad. Sci., Prague, 1964).

[27]R. Simanjuntak and A. Tritama, Distance antimagic product graphs, Symmetry 14 (2022), 1411. https://doi.org/10.3390/sym14071411.

[28]B. M. Stewart, Magic trees, Canad. J. Math. 18 (1966), 1031-1059.

[29]S. Vani Shree and S. Dhanalakshmi, Application of edge bimagic mean labeling in data security, Asian Pacific Journal of Mathematics 10(41) (2023), 1-12.

[30]W. D. Wallis, Edy T. Baskoro, Mirka Miller and Slamin, Edge-magic total labelings, Australasian Journal of Combinatorics 22 (2000), 177-190.

Number of Downloads: 83 | Number of Views: 175