Supermagic Complete Graphs
Canadian journal of mathematics, Tome 19 (1967) no. 1, pp. 427-438

Voir la notice de l'article provenant de la source Cambridge University Press

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 K 2 is magic and showed that K 3 and K 4 are not magic.
Stewart, B. M. Supermagic Complete Graphs. Canadian journal of mathematics, Tome 19 (1967) no. 1, pp. 427-438. doi: 10.4153/CJM-1967-035-9
@article{10_4153_CJM_1967_035_9,
     author = {Stewart, B. M.},
     title = {Supermagic {Complete} {Graphs}},
     journal = {Canadian journal of mathematics},
     pages = {427--438},
     year = {1967},
     volume = {19},
     number = {1},
     doi = {10.4153/CJM-1967-035-9},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1967-035-9/}
}
TY  - JOUR
AU  - Stewart, B. M.
TI  - Supermagic Complete Graphs
JO  - Canadian journal of mathematics
PY  - 1967
SP  - 427
EP  - 438
VL  - 19
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1967-035-9/
DO  - 10.4153/CJM-1967-035-9
ID  - 10_4153_CJM_1967_035_9
ER  - 
%0 Journal Article
%A Stewart, B. M.
%T Supermagic Complete Graphs
%J Canadian journal of mathematics
%D 1967
%P 427-438
%V 19
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1967-035-9/
%R 10.4153/CJM-1967-035-9
%F 10_4153_CJM_1967_035_9

Stewart, B. M., Magic graphs, Can. J. Math., 18 (1966), 1031–1059. Google Scholar

Cité par Sources :