Distance magic labelings of product graphs

Rinovia Simanjuntak, I Wayan Palton Anuwiksa

A graph $G$ is said to be distance magic if there exists a bijection $f:V\to \{1,2,\dots ,v\}$ and a constant {\sf k} such that for any vertex $x$, $\sum_{y\in N(x)} f(y…