On magic and supermagic line graphs

Jaroslav Ivančo; Z. Lastivková; A. Semaničová

Mathematica Bohemica (2004)

  • Volume: 129, Issue: 1, page 33-42
  • ISSN: 0862-7959

Abstract

top
A graph is called magic (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. We characterize magic line graphs of general graphs and describe some class of supermagic line graphs of bipartite graphs.

How to cite

top

Ivančo, Jaroslav, Lastivková, Z., and Semaničová, A.. "On magic and supermagic line graphs." Mathematica Bohemica 129.1 (2004): 33-42. <http://eudml.org/doc/249408>.

@article{Ivančo2004,
abstract = {A graph is called magic (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. We characterize magic line graphs of general graphs and describe some class of supermagic line graphs of bipartite graphs.},
author = {Ivančo, Jaroslav, Lastivková, Z., Semaničová, A.},
journal = {Mathematica Bohemica},
keywords = {magic graphs; supermagic graphs; line graphs; magic graphs; supermagic graphs; line graphs},
language = {eng},
number = {1},
pages = {33-42},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {On magic and supermagic line graphs},
url = {http://eudml.org/doc/249408},
volume = {129},
year = {2004},
}

TY - JOUR
AU - Ivančo, Jaroslav
AU - Lastivková, Z.
AU - Semaničová, A.
TI - On magic and supermagic line graphs
JO - Mathematica Bohemica
PY - 2004
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 129
IS - 1
SP - 33
EP - 42
AB - A graph is called magic (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. We characterize magic line graphs of general graphs and describe some class of supermagic line graphs of bipartite graphs.
LA - eng
KW - magic graphs; supermagic graphs; line graphs; magic graphs; supermagic graphs; line graphs
UR - http://eudml.org/doc/249408
ER -

References

top
  1. Two classes of super-magic graphs, J. Combin. Math. Combin. Comput. 23 (1997), 113–120. (1997) MR1432751
  2. 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
  3. Pearls in Graph Theory, Academic Press, San Diego, 1990. (1990) MR1069559
  4. On supermagic regular graphs, Math. Bohem. 125 (2000), 99–114. (2000) MR1752082
  5. 10.1016/S0195-6698(88)80066-0, Europ. J. Combin. 9 (1988), 363–368. (1988) Zbl0657.05065MR0950055DOI10.1016/S0195-6698(88)80066-0
  6. Characterization of magic graphs, Czechoslovak Math. J. 33 (1988), 435–438. (1988) MR0718926
  7. On magic graphs, Math. Slovaca 26 (1976), 329–335. (1976) MR0434889
  8. Problem 27. Theory of Graphs and Its Applications, Proc. Symp. Smolenice, Praha, (1963), 163–164. (1963) 
  9. Magic graphs, Canad. J. Math. 18 (1966), 1031–1059. (1966) Zbl0149.21401MR0197358
  10. 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.