Orientable ℤn-distance magic labeling of the Cartesian product of many cycles

8Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

The following generalization of distance magic graphs was introduced in [2]. A directed ℤn- distance magic labeling of an oriented graph G = (V,A) of order n is a bijection ℓ: V → ℤn with the property that there is a μ ∈ ℤ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 ℓ for G, we say that G is orientable ℤn-distance magic and the directed ℤn-distance magic labeling ℓ we call an orientable ℤn-distance magic labeling. In this paper, we find orientable ℤn- distance magic labelings of the Cartesian product of cycles. In addition, we show that even-ordered hypercubes are orientable ℤn-distance magic.

Cite

CITATION STYLE

APA

Freyberg, B., & Keranen, M. (2017). Orientable ℤn-distance magic labeling of the Cartesian product of many cycles. Electronic Journal of Graph Theory and Applications, 5(2), 304–311. https://doi.org/10.5614/ejgta.2017.5.2.11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free