Geodesic
On supermagic regular graphs
Mathematica Bohemica, Tome 125 (2000) no. 1, pp. 99-114.

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

A graph is called supermagic if it admits a labelling of the edges by pairwise different consecutive positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. Some constructions of supermagic labellings of regular graphs are described. Supermagic regular complete multipartite graphs and supermagic cubes are characterized.
DOI : 10.21136/MB.2000.126259
Classification : 05C75, 05C78
Keywords: supermagic graphs; complete multipartite graphs; products of graphs 
@article{10_21136_MB_2000_126259,
     author = {Ivan\v{c}o, Jaroslav},
     title = {On supermagic regular graphs},
     journal = {Mathematica Bohemica},
     pages = {99--114},
     publisher = {mathdoc},
     volume = {125},
     number = {1},
     year = {2000},
     doi = {10.21136/MB.2000.126259},
     mrnumber = {1752082},
     zbl = {0963.05121},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/MB.2000.126259/}
}
TY  - JOUR
AU  - Ivančo, Jaroslav
TI  - On supermagic regular graphs
JO  - Mathematica Bohemica
PY  - 2000
SP  - 99
EP  - 114
VL  - 125
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.21136/MB.2000.126259/
DO  - 10.21136/MB.2000.126259
LA  - en
ID  - 10_21136_MB_2000_126259
ER  - 
%0 Journal Article
%A Ivančo, Jaroslav
%T On supermagic regular graphs
%J Mathematica Bohemica
%D 2000
%P 99-114
%V 125
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.21136/MB.2000.126259/
%R 10.21136/MB.2000.126259
%G en
%F 10_21136_MB_2000_126259
Ivančo, Jaroslav. On supermagic regular graphs. Mathematica Bohemica, Tome 125 (2000) no. 1, pp. 99-114. doi : 10.21136/MB.2000.126259. http://geodesic.mathdoc.fr/articles/10.21136/MB.2000.126259/

Cité par Sources :