### Abstract

Let G=(V,E) be a graph and Γ an Abelian group both of order n. A Γ-distance magic labeling of G is a bijection ℓ:V→Γ for which there exists μ∈Γ such that ∑_{x∈N(v)}ℓ(x)=μ for all v∈V, where N(v) is the neighborhood of v. Froncek showed that the Cartesian product C_{m}□C_{n}, m,n≥3 is a Z_{mn}-distance magic graph if and only if mn is even. It is also known that if mn is even then C_{m}□C_{n} has Z_{α}×A-magic labeling for any α≡0(modlcm(m,n)) and any Abelian group A of order mn∕α. However, the full characterization of group distance magic Cartesian product of two cycles is still unknown. In the paper we make progress towards the complete solution of this problem by proving some necessary conditions. We further prove that for n even the graph C_{n}□C_{n} has a Γ-distance magic labeling for any Abelian group Γ of order n^{2}. Moreover we show that if m≠n, then there does not exist a (Z_{2})^{m+n}-distance magic labeling of the Cartesian product C_{2m }□C_{2n }. We also give a necessary and sufficient condition for C_{m}□C_{n} with gcd(m,n)=1 to be Γ-distance magic.

Original language | English (US) |
---|---|

Article number | 111807 |

Journal | Discrete Mathematics |

Volume | 343 |

Issue number | 5 |

DOIs | |

State | Published - May 2020 |

### Keywords

- Abelian group
- Cartesian product
- Distance magic labeling

## Fingerprint Dive into the research topics of 'Group distance magic Cartesian product of two cycles'. Together they form a unique fingerprint.

## Cite this

*Discrete Mathematics*,

*343*(5), [111807]. https://doi.org/10.1016/j.disc.2019.111807