On magic joins of graphs

Jaroslav Ivančo; Tatiana Polláková

Mathematica Bohemica (2012)

  • Volume: 137, Issue: 4, page 459-472
  • ISSN: 0862-7959

Abstract

top
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.

How to cite

top

Ivančo, Jaroslav, and Polláková, Tatiana. "On magic joins of graphs." Mathematica Bohemica 137.4 (2012): 459-472. <http://eudml.org/doc/246512>.

@article{Ivančo2012,
abstract = {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.},
author = {Ivančo, Jaroslav, Polláková, Tatiana},
journal = {Mathematica Bohemica},
keywords = {magic graph; supermagic graph; join of graphs; magic graph; supermagic graph; join of graphs},
language = {eng},
number = {4},
pages = {459-472},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {On magic joins of graphs},
url = {http://eudml.org/doc/246512},
volume = {137},
year = {2012},
}

TY - JOUR
AU - Ivančo, Jaroslav
AU - Polláková, Tatiana
TI - On magic joins of graphs
JO - Mathematica Bohemica
PY - 2012
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 137
IS - 4
SP - 459
EP - 472
AB - 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.
LA - eng
KW - magic graph; supermagic graph; join of graphs; magic graph; supermagic graph; join of graphs
UR - http://eudml.org/doc/246512
ER -

References

top
  1. Bezegová, Ľ., Ivančo, J., 10.1016/j.disc.2010.09.005, Discrete Math. 310 (2010), 3571-3578. (2010) Zbl1200.05199MR2734738DOI10.1016/j.disc.2010.09.005
  2. Bose, R. C., Shrikhande, S. S., Parker, E. T., 10.4153/CJM-1960-016-5, Can. J. Math. 12 (1960), 189-203. (1960) Zbl0093.31905MR0122729DOI10.4153/CJM-1960-016-5
  3. Doob, M., 10.1016/S0095-8956(78)80013-6, J. Combin. Theory, Ser. B 25 (1978), 94-104. (1978) Zbl0384.05054MR0505855DOI10.1016/S0095-8956(78)80013-6
  4. Drajnová, S., Ivančo, J., Semaničová, A., 10.1002/jgt.20144, J. Graph Theory 52 (2006), 15-26. (2006) Zbl1088.05063MR2214438DOI10.1002/jgt.20144
  5. Gallian, J. A., A dynamic survey of graph labeling, Electron. J. Combin. 17 (2010), #DS6. (2010) MR1668059
  6. Ivančo, J., On supermagic regular graphs, Math. Bohem. 125 (2000), 99-114. (2000) Zbl0963.05121MR1752082
  7. Ivančo, J., Semaničová, A., Some constructions of supermagic non-regular graphs, Austral. J. Comb. 38 (2007), 127-139. (2007) Zbl1134.05094MR2324280
  8. Jeurissen, R. H., 10.1016/S0195-6698(88)80066-0, Europ. J. Combin. 9 (1988), 363-368. (1988) Zbl0657.05065MR0950055DOI10.1016/S0195-6698(88)80066-0
  9. Jezný, S., Trenkler, M., Characterization of magic graphs, Czech. Math. J. 33 (1983), 435-438. (1983) Zbl0571.05030MR0718926
  10. Sedláček, J., Problem 27. Theory of Graphs and Its Applications, Proc. Symp. Smolenice, Academia, Praha (1963), 163-164. (1963) 
  11. Semaničová, A., Magic graphs having a saturated vertex, Tatra Mountains Math. Publ. 36 (2007), 121-128. (2007) Zbl1164.05060MR2378744
  12. Stewart, B. M., 10.4153/CJM-1966-104-7, Canad. J. Math. 18 (1966), 1031-1059. (1966) Zbl0149.21401MR0197358DOI10.4153/CJM-1966-104-7

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.