Distance magic labeling and two products of graphs

Marcin Anholcer, Sylwia Cichacz, Iztok Peterin +1

Let $G=(V,E)$ be a graph of order $n$. A distance magic labeling of $G$ is a bijection $\ell :V\to 1,...,n$ for which there exists a positive integer $k$ such that…