Enumerating the distance magic labelings of a distance magic graph

A V Prajeesh, Krishnan Paramasivam

Let $G=(V,E)$ be a graph of order $n$. A bijection $f:V\to \{1,2,\cdots ,n\}$ is a distance magic labeling of $G$ if there exists a positive integer $k$ such that $\sum…