Group distance magic graphs $G\times C_n$
Combinatorics
2017-12-04 v1
Abstract
A -distance magic labeling of a graph with is a bijection from to an Abelian group of order such that the weight of every vertex is equal to the same element , called the \emph{magic constant}. In this paper we will show that if is a graph of order for some natural numbers , such that for some constant for any , then there exists a -distance magic labeling for any Abelian group of order for the direct product . Moreover if is even then there exists a -distance magic labeling for any Abelian group of order for the direct product .
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}
}