Tetravalent distance magic graphs of small order and an infinite family of examples

Ksenija Rozman, Primož Šparl

A graph of order $n$ is distance magic if it admits a bijective labeling of its vertices with integers from $1$ to $n$ such that each vertex has the same sum of the labels of its n…