Characterization of Completely k-Magic Regular Graphs

Abstract

Let k ∈ N and c ∈ Zk, where Z1=Z. A graph G=(V(G),E(G)) is said to be c-sum k-magic if there is a labeling :E(G) → Zk \0\ such that Σu ∈ N(v) (uv) c 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.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…