English

Group distance magic graphs $G\times C_n$

Combinatorics 2017-12-04 v1

Abstract

A Γ\Gamma-distance magic labeling of a graph G=(V,E)G=(V,E) with V=n|V | = n is a bijection ff from VV to an Abelian group Γ\Gamma 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 μΓ\mu \in \Gamma, called the \emph{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+2\deg(v)\equiv c \imod {2^{p+2}} for some constant cc for any vV(G)v\in V(G), then there exists a Γ\Gamma-distance magic labeling for any Abelian group Γ\Gamma of order 4n4n for the direct product G×C4G\times C_4. Moreover if cc is even then there exists a Γ\Gamma-distance magic labeling for any Abelian group Γ\Gamma of order 8n8n for the direct product G×C8G\times C_8.

Keywords

Cite

@article{arxiv.1302.6561,
  title  = {Group distance magic graphs $G\times C_n$},
  author = {Sylwia Cichacz},
  journal= {arXiv preprint arXiv:1302.6561},
  year   = {2017}
}
R2 v1 2026-06-21T23:33:05.334Z