English

Characterization of Completely $k$-Magic Regular Graphs

Combinatorics 2017-11-22 v1

Abstract

Let kNk \in \mathbb{N} and cZkc \in \mathbb{Z}_k, where Z1=Z\mathbb{Z}_1=\mathbb{Z}. A graph G=(V(G),E(G))G=(V(G),E(G)) is said to be cc-sum kk-magic if there is a labeling :E(G)Zk{0}\ell:E(G) \rightarrow \mathbb{Z}_k \setminus \{0\} such that uN(v)(uv)c(modk)\sum_{u \in N(v)} \ell(uv) \equiv c \pmod{k} for every vertex vv of GG, where N(v)N(v) is the neighborhood of vv in GG. We say that GG is completely kk-magic whenever it is cc-sum kk-magic for every cZkc \in \mathbb{Z}_k. In this paper, we characterize all completely kk-magic regular graphs.

Keywords

Cite

@article{arxiv.1606.04461,
  title  = {Characterization of Completely $k$-Magic Regular Graphs},
  author = {Arnold A. Eniego and I. J. L. Garces},
  journal= {arXiv preprint arXiv:1606.04461},
  year   = {2017}
}

Comments

13 pages

R2 v1 2026-06-22T14:25:14.343Z