Orientable ℤn-distance magic labeling of the cartesian product of two cycles

Bryan Freyberg, Melissa Keranen

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

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 languageEnglish (US)
Pages (from-to)222-235
Number of pages14
JournalAustralasian Journal of Combinatorics
Volume69
Issue number2
StatePublished - Jan 1 2017

Fingerprint Dive into the research topics of 'Orientable ℤ<sub>n</sub>-distance magic labeling of the cartesian product of two cycles'. Together they form a unique fingerprint.

Cite this