Supermagic Complete Graphs
1967 ◽
Vol 19
◽
pp. 427-438
◽
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 sums1have a constant value σ(α) for k = 1, 2, … , n. We noted that K2 is magic and showed that K3 and K4 are not magic.
1998 ◽
Vol 123
(3)
◽
pp. 549-559
◽
Keyword(s):
2019 ◽
Vol 9
(1S3)
◽
pp. 352-355
Keyword(s):
2014 ◽
Vol 24
(4)
◽
pp. 658-679
◽
Keyword(s):
1969 ◽
Vol 21
◽
pp. 992-1000
◽
Keyword(s):
1975 ◽
Vol 77
(2)
◽
pp. 313-324
◽
2015 ◽
Vol 25
(1)
◽
pp. 89-107
◽
Keyword(s):
2012 ◽
Vol 21
(07)
◽
pp. 1250065
◽
1996 ◽
Vol 5
(3)
◽
pp. 297-306
◽
1970 ◽
Vol 22
(5)
◽
pp. 1082-1096
◽
1995 ◽
Vol 118
(2)
◽
pp. 191-206
◽
Keyword(s):