Supermagic Complete Graphs
B. M. Stewart · Canadian Journal of Mathematics · 1967
In our paper “Magic graphs” (1) we showed that every complete graph Kn with n ⩾ 5 is “magic,” i.e., if the vertex set is indicated {vi} and if eij is the edge joining vi and vj, i ≠ j , then there exists a function α(eij) such that the set {α(eij)} consists of distinct positive rational integers and the vertex sums 1 have a constant value σ(α) for k = 1, 2, … , n. We noted that K2 is magic and showed that K3 and K4 are not magic.