A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ : V → {1, . . . , n} such that the weight of every vertex v, computed as the sum of the labels on the vertices in the open neighborhood of v, is a constant. In this paper, we show that hypercubes with dimension divisible by four are not distance magic. We also provide some positive results by proving necessary and sufficient conditions for the Cartesian product of certain complete multipartite graphs and the cycle on four vertices to be distance magic.
@article{bwmeta1.element.doi-10_7151_dmgt_1852,
author = {Sylwia Cichacz and Dalibor Froncek and Elliot Krop and Christopher Raridan},
title = {Distance Magic Cartesian Products of Graphs},
journal = {Discussiones Mathematicae Graph Theory},
volume = {36},
year = {2016},
pages = {299-308},
zbl = {1338.05226},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_7151_dmgt_1852}
}
Sylwia Cichacz; Dalibor Froncek; Elliot Krop; Christopher Raridan. Distance Magic Cartesian Products of Graphs. Discussiones Mathematicae Graph Theory, Tome 36 (2016) pp. 299-308. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_7151_dmgt_1852/