Orientable ℤN-Distance Magic Graphs

Abstract

Let G = (V, E) be a graph of order n. A distance magic labeling of G is a bijection ℓ: V → {1, 2, . . ., n} for which there exists a positive integer k such that ∑x∈N(v)ℓ(x) = k for all v ∈ V, where N(v) is the open neighborhood of v.

Keywords

• distance magic graph
• digraph
• flow graph
• 5c15
• 05c22
• 05c25
• 05c76
• 05c78