English

Note on group distance magic graphs $G[C_4]$

Combinatorics 2013-02-26 v2

Abstract

A \emph{group distance magic labeling} or a \gr\gr-distance magic labeling of a graph G(V,E)G(V,E) with V=n|V | = n is an injection ff from VV to an Abelian group \gr\gr of order nn such that the weight w(x)=yNG(x)f(y)w(x)=\sum_{y\in N_G(x)}f(y) of every vertex xVx \in V is equal to the same element μ\gr\mu \in \gr, called the magic constant. In this paper we will show that if GG is a graph of order n=2p(2k+1)n=2^{p}(2k+1) for some natural numbers pp, kk such that deg(v)c\imod2p+1\deg(v)\equiv c \imod {2^{p+1}} for some constant cc for any vV(G)v\in V(G), then there exists an \gr\gr-distance magic labeling for any Abelian group \gr\gr for the graph G[C4]G[C_4]. Moreover we prove that if \gr\gr is an arbitrary Abelian group of order 4n4n such that \gr\zet2×\zet2×\gA\gr \cong \zet_2 \times\zet_2 \times \gA for some Abelian group \gA\gA of order nn, then exists a \gr\gr-distance magic labeling for any graph G[C4]G[C_4].

Keywords

Cite

@article{arxiv.1204.0705,
  title  = {Note on group distance magic graphs $G[C_4]$},
  author = {Sylwia Cichacz},
  journal= {arXiv preprint arXiv:1204.0705},
  year   = {2013}
}
R2 v1 2026-06-21T20:44:04.118Z