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

MR Zbl
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.
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 
Ivančo, Jaroslav. On supermagic regular graphs. Mathematica Bohemica, Tome 125 (2000) no. 1, pp. 99-114. doi: 10.21136/MB.2000.126259
@article{10_21136_MB_2000_126259,
     author = {Ivan\v{c}o, Jaroslav},
     title = {On supermagic regular graphs},
     journal = {Mathematica Bohemica},
     pages = {99--114},
     year = {2000},
     volume = {125},
     number = {1},
     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
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
%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

[1] M. Bača I. Holländer, Ko-Wei Lih: Two classes of super-magic graphs. J. Combin. Math. Combin. Comput. 23 (1997), 113-120. | MR

[2] T. Bier D. G. Rogers: Balanced magic rectangles. Europ. J. Combin. 14 (1993), 285-299. | DOI | MR

[3] M. Doob: Characterizations of regular magic graphs. J. Combin. Theory, Ser. B 25 (1978), 94-104. | DOI | MR | Zbl

[4] R. B. Jeurissen: Magic graphs, a characterization. Europ. J. Combin. 9 (1988), 363-368. | DOI | MR | Zbl

[5] S. Jezný M. Trenkler: Characterization of magic graphs. Czechoslovak Math. J. 33 (1983), 435-438. | MR

[6] J. Sedláček: Problem 27. Theory of Graphs and Its Applications, Proc. Symp. Smolenice. Praha, 1963, pp. 163-164.

[7] J. Sedláček: On magic graphs. Math. Slovaca 26 (1976), 329-335. | MR

[8] B. M. Stewart: Magic graphs. Canad. J. Math. 18 (1966), 1031-1059. | DOI | MR | Zbl

[9] B. M. Stewart: Supermagic complete graphs. Canad. J. Math. 19 (1967), 427-438. | DOI | MR | Zbl

Cité par Sources :