Geodesic
On magic joins of graphs
Mathematica Bohemica, Tome 137 (2012) no. 4, pp. 459-472

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

MR Zbl
A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise different (and consecutive) integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we characterize magic joins of graphs and we establish some conditions for magic joins of graphs to be supermagic.
A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise different (and consecutive) integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we characterize magic joins of graphs and we establish some conditions for magic joins of graphs to be supermagic.
DOI : 10.21136/MB.2012.143000
Classification : 05C78
Keywords: magic graph; supermagic graph; join of graphs 
Ivančo, Jaroslav; Polláková, Tatiana. On magic joins of graphs. Mathematica Bohemica, Tome 137 (2012) no. 4, pp. 459-472. doi: 10.21136/MB.2012.143000
@article{10_21136_MB_2012_143000,
     author = {Ivan\v{c}o, Jaroslav and Poll\'akov\'a, Tatiana},
     title = {On magic joins of graphs},
     journal = {Mathematica Bohemica},
     pages = {459--472},
     year = {2012},
     volume = {137},
     number = {4},
     doi = {10.21136/MB.2012.143000},
     mrnumber = {3058276},
     zbl = {1274.05420},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/MB.2012.143000/}
}
TY  - JOUR
AU  - Ivančo, Jaroslav
AU  - Polláková, Tatiana
TI  - On magic joins of graphs
JO  - Mathematica Bohemica
PY  - 2012
SP  - 459
EP  - 472
VL  - 137
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.21136/MB.2012.143000/
DO  - 10.21136/MB.2012.143000
LA  - en
ID  - 10_21136_MB_2012_143000
ER  - 
%0 Journal Article
%A Ivančo, Jaroslav
%A Polláková, Tatiana
%T On magic joins of graphs
%J Mathematica Bohemica
%D 2012
%P 459-472
%V 137
%N 4
%U http://geodesic.mathdoc.fr/articles/10.21136/MB.2012.143000/
%R 10.21136/MB.2012.143000
%G en
%F 10_21136_MB_2012_143000

[1] Bezegová, Ľ., Ivančo, J.: An extension of regular supermagic graphs. Discrete Math. 310 (2010), 3571-3578. | DOI | MR | Zbl

[2] Bose, R. C., Shrikhande, S. S., Parker, E. T.: Further results on the construction of mutually orthogonal Latin squares and the falsity of Euler's conjecture. Can. J. Math. 12 (1960), 189-203. | DOI | MR | Zbl

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

[4] Drajnová, S., Ivančo, J., Semaničová, A.: Numbers of edges in supermagic graphs. J. Graph Theory 52 (2006), 15-26. | DOI | MR | Zbl

[5] Gallian, J. A.: A dynamic survey of graph labeling. Electron. J. Combin. 17 (2010), \#DS6. | MR

[6] Ivančo, J.: On supermagic regular graphs. Math. Bohem. 125 (2000), 99-114. | MR | Zbl

[7] Ivančo, J., Semaničová, A.: Some constructions of supermagic non-regular graphs. Austral. J. Comb. 38 (2007), 127-139. | MR | Zbl

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

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

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

[11] Semaničová, A.: Magic graphs having a saturated vertex. Tatra Mountains Math. Publ. 36 (2007), 121-128. | MR | Zbl

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

Cité par Sources :