1 research outputs found
Orientable β€N-Distance Magic Graphs
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