A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ from V to the set {1, . . . , n} such that the weight w(x) = ∑y∈NG(x) ℓ(y) of every vertex x ∈ V is equal to the same element μ, called the magic constant. In this paper, we study unions of distance magic graphs as well as some properties of such graphs.
@article{bwmeta1.element.doi-10_7151_dmgt_1932,
author = {Sylwia Cichacz and Mateusz Nikodem},
title = {Union of Distance Magic Graphs},
journal = {Discussiones Mathematicae Graph Theory},
volume = {37},
year = {2017},
pages = {239-249},
zbl = {1354.05115},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_7151_dmgt_1932}
}
Sylwia Cichacz; Mateusz Nikodem. Union of Distance Magic Graphs. Discussiones Mathematicae Graph Theory, Tome 37 (2017) pp. 239-249. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_7151_dmgt_1932/