Distance magic Cartesian product of graphs
Sylwia Cichacz, Dalibor Fronček, Elliot Krop, Christopher Raridan · Discussiones Mathematicae Graph Theory · 2015
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.