A directed ℤn-distance magic labeling of an oriented graph G→ = (V,A) of order n is a bijection l→: V → ℤn with the property that there exists µ ∈ ℤn (called the magic constant) such that If for a graph G there exists an orientation G→ such that there is a directed ℤn-distance magic labeling l→ for G→, we say that G is orientable ℤn-distance magic. In this paper, we prove that the Cartesian product of any two cycles is orientable ℤn-distance magic.
|Original language||English (US)|
|Number of pages||14|
|Journal||Australasian Journal of Combinatorics|
|State||Published - Jan 1 2017|