On supermagic regular graphs

Jaroslav Ivančo

Mathematica Bohemica (2000)

  • Volume: 125, Issue: 1, page 99-114
  • ISSN: 0862-7959

Abstract

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

How to cite

top

Ivančo, Jaroslav. "On supermagic regular graphs." Mathematica Bohemica 125.1 (2000): 99-114. <http://eudml.org/doc/248683>.

@article{Ivančo2000,
abstract = {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.},
author = {Ivančo, Jaroslav},
journal = {Mathematica Bohemica},
keywords = {supermagic graphs; complete multipartite graphs; products of graphs; supermagic graphs; complete multipartite graphs; products of graphs},
language = {eng},
number = {1},
pages = {99-114},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {On supermagic regular graphs},
url = {http://eudml.org/doc/248683},
volume = {125},
year = {2000},
}

TY - JOUR
AU - Ivančo, Jaroslav
TI - On supermagic regular graphs
JO - Mathematica Bohemica
PY - 2000
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 125
IS - 1
SP - 99
EP - 114
AB - 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.
LA - eng
KW - supermagic graphs; complete multipartite graphs; products of graphs; supermagic graphs; complete multipartite graphs; products of graphs
UR - http://eudml.org/doc/248683
ER -

References

top
  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. (1997) MR1432751
  2. T. Bier D. G. Rogers, 10.1006/eujc.1993.1032, Europ. J. Combin. 14 (1993), 285-299. (1993) MR1226576DOI10.1006/eujc.1993.1032
  3. M. Doob, 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. R. B. Jeurissen, 10.1016/S0195-6698(88)80066-0, Europ. J. Combin. 9 (1988), 363-368. (1988) Zbl0657.05065MR0950055DOI10.1016/S0195-6698(88)80066-0
  5. S. Jezný M. Trenkler, Characterization of magic graphs, Czechoslovak Math. J. 33 (1983), 435-438. (1983) MR0718926
  6. J. Sedláček, Problem 27, Theory of Graphs and Its Applications, Proc. Symp. Smolenice. Praha, 1963, pp. 163-164. (1963) 
  7. J. Sedláček, On magic graphs, Math. Slovaca 26 (1976), 329-335. (1976) MR0434889
  8. B. M. Stewart, 10.4153/CJM-1966-104-7, Canad. J. Math. 18 (1966), 1031-1059. (1966) Zbl0149.21401MR0197358DOI10.4153/CJM-1966-104-7
  9. B. M. Stewart, 10.4153/CJM-1967-035-9, Canad. J. Math. 19 (1967), 427-438. (1967) Zbl0162.27801MR0209180DOI10.4153/CJM-1967-035-9

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.