On zero-sum $\mathbb{Z}_{2j}^k$-magic graphs
J. P. Georges, D. Mauro, and K. Wash

TL;DR
This paper investigates zero-sum group-magic labelings of graphs, especially focusing on $ ext{Z}_{2j}^k$ groups, establishing bounds and conditions for their existence in various classes of graphs.
Contribution
It introduces the concept of $ ext{Z}_{2j}^k$-magic graphs, provides bounds on the minimal group size for zero-sum magic labelings, and characterizes cubic graphs based on their zero-sum group-magic properties.
Findings
$ ext{Z}_{2j}^k$-magic labelings exist under certain bounds
$ ext{Z}_4$-magic property for cubic graphs depends on 1-factor presence
All $r$-regular graphs with $r eq 1$ have finite $ ext{Z}_{2j}^k$-magic labelings
Abstract
Let be a finite graph and let be an abelian group with identity 0. Then is \textit{-magic} if and only if there exists a function from into such that for some , for every , where is the set of edges incident to . Additionally, is \textit{zero-sum -magic} if and only if exists such that . We consider zero-sum -magic labelings of graphs, with particular attention given to . For , let be the smallest positive integer such that is zero-sum -magic if exists; infinity otherwise. We establish upper bounds on when is finite, and show that is finite for all -regular , $r…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · graph theory and CDMA systems
