# Characterization of Completely $k$-Magic Regular Graphs

@article{Eniego2016CharacterizationOC,
title={Characterization of Completely \$k\$-Magic Regular Graphs},
author={Arnold A. Eniego and I. Garces},
journal={arXiv: Combinatorics},
year={2016}
}
• Published 2016
• Mathematics, Physics
• arXiv: Combinatorics
Let $k \in \mathbb{N}$ and $c \in \mathbb{Z}_k$, where $\mathbb{Z}_1=\mathbb{Z}$. A graph $G=(V(G),E(G))$ is said to be $c$-sum $k$-magic if there is a labeling $\ell:E(G) \rightarrow \mathbb{Z}_k \setminus \{0\}$ such that $\sum_{u \in N(v)} \ell(uv) \equiv c \pmod{k}$ for every vertex $v$ of $G$, where $N(v)$ is the neighborhood of $v$ in $G$. We say that $G$ is completely $k$-magic whenever it is $c$-sum $k$-magic for every $c \in \mathbb{Z}_k$. In this paper, we characterize all completely… Expand
1 Citations

#### References

SHOWING 1-10 OF 15 REFERENCES
Zero-Sum Magic Labelings and Null Sets of Regular Graphs
• Mathematics, Computer Science
• Electron. J. Comb.
• 2014
Constant Sum Flows in Regular Graphs
• Mathematics, Computer Science
• FAW-AAIM
• 2011
Graph Theory
• Computer Science