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

Bryan Freyberg; Melissa Keranen

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

Bryan Freyberg
, Melissa Keranen

Mathematics & Statistics

Research output: Contribution to journal › Article › peer-review

7 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 language	English (US)
Pages (from-to)	222-235
Number of pages	14
Journal	Australasian Journal of Combinatorics
Volume	69
Issue number	2
State	Published - 2017

Bibliographical note

Publisher Copyright:
© 2017, University of Queensland. All rights reserved.

Find It

Find It at U of M Libraries

Cite this

@article{d457ccc225c24984b3a6d344f737a90c,

title = "Orientable ℤn-distance magic labeling of the cartesian product of two cycles",

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.",

author = "Bryan Freyberg and Melissa Keranen",

year = "2017",

language = "English (US)",

volume = "69",

pages = "222--235",

journal = "Australasian Journal of Combinatorics",

issn = "1034-4942",

publisher = "University of Queensland Press",

number = "2",

}

TY - JOUR

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

AU - Freyberg, Bryan

AU - Keranen, Melissa

PY - 2017

Y1 - 2017

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85029698919

UR - https://www.scopus.com/pages/publications/85029698919#tab=citedBy

M3 - Article

AN - SCOPUS:85029698919

SN - 1034-4942

VL - 69

SP - 222

EP - 235

JO - Australasian Journal of Combinatorics

JF - Australasian Journal of Combinatorics

IS - 2

ER -

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

Abstract

Bibliographical note

Find It

Other files and links

Fingerprint

Cite this