Z2nm-supermagic labeling of Cn#Cm

Dalibor Froncek, James McKeown, John McKeown, Michael McKeown

Abstract


A Γ-supermagic labeling of a graph G = (V, E) with ∣E∣ = k is a bijection from E to an Abelian group Γ of order k such that the sum of labels of all incident edges of every vertex xV is equal to the same element μ ∈ Γ. We present a Z2nm-supermagic labeling of Cartesian product of two cycles, CnCm for n odd. This along with an earlier result by Ivančo proves that a Z2nm-supermagic labeling of CnCm exists for every n, m ≥ 3.


Keywords


vertex-magic edge labeling, supermagic labeling, group supermagic labeling

Full Text:

PDF

References


S. Cichacz, Group distance magic labeling of some cycle-related graphs, Australas. J. Combin., 57 (2013), 235-243.

S. Cichacz and D. Froncek, Distance magic circulant graphs, Discrete Math., 339 (1) (2016), 84-94.

D. Froncek, Group distance magic labeling of Cartesian product of cycles, Australas. J. Combin., 55 (2013), 167-174.

J. Ivanv co, On Supermagic Regular Graphs, Mathematica Bohemica, 125 (2000), 99-114.

S. B. Rao, T. Singh and V. Parameswaran, Some sigma labelled graphs:I, Graphs, Combinatorics, Algorithms and Applications, S. Armugam, B. D. Acharya and S. B. Rao, eds., (2004), 125-133, Narosa Publishing House, New Delhi.




DOI: http://dx.doi.org/10.19184/ijc.2018.2.2.1

Refbacks

  • There are currently no refbacks.


ISSN: 2541-2205

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View IJC Stats