On magic distinct labellings of simple graphs (Q6108371)

\textit{J. A. MacDougall} et al. [Util. Math. 61, 3--21 (2002; Zbl 1008.05135)] have introduced the concept of magic labelling of simple graphs. A magic labelling of a graph $G$ with magic sum $s$ is a labelling of the edges of $G$ by nonnegative integers such that for each vertex $v\in V$, the sum of labels of all edges incident to $v$ is equal to the same number $s$. A magic distinct labelling is a magic labelling whose labels are distinct. It is said to be pure if the labels are $1,2,\dots,n$. The authors consider here the complete construction of all magic labellings of a given graph $G$. They illustrate it in detail by dealing with three regular graphs and a non-regular graph. They give combinatorial proofs. The structure they find here can be used to enumerate the corresponding magic distinct labellings. The idea of using the generating function is highly laudable.