Magic labelings of distance at most 2

Rinovia Simanjuntak, Mona Elviyenti, Mohammad Navie Jauhari +2

For an arbitrary set of distances $D\subseteq \{0,1,\dots ,d\}$, a graph $G$ is said to be $D$-distance magic if there exists a bijection $f:V\to \{1,2,\dots ,v\}$ and…