1 paper
Petr Kovář, Ksenija Rozman, Primož Šparl
A graph is distance magic if it admits a bijective labeling of its vertices by integers from 1 up to the order of the graph in such a way that the sum of the labels of all the ne…