We prove: A connected magic graph with \(n\) vertices and \(q\) edges exists if and only if \(n = 2\) and \(q = 1\) or \(n \geq 5\) and \(\frac{5n}{4} < q < \frac{n(n-1)}{2} \).
Citation
Marian Trenkler. Numbers of Vertices and Edges of Magic Graphs[J], Ars Combinatoria, Volume 055. 93-96. .