Document Type
Article
Publication Date
2016
Abstract
Let k ∈ N and c ∈ Zk. A graph G is said to be c-sum k-magic if there is a labeling ` : E(G) → Zk \ {0} such that P u∈N(v) `(uv) ≡ c (mod 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 ∈ Zk. In this paper, we characterize all completely k-magic regular graphs.
Recommended Citation
Eniego, A. A., & Garces, I. J. L. (2017, October). Characterization of completely k-magic regular graphs. In Journal of Physics: Conference Series (Vol. 893, No. 1, p. 012039). IOP Publishing.