Geodesic
Supermagic Graphs Having a Saturated Vertex
Discussiones Mathematicae. Graph Theory, Tome 34 (2014) no. 1, pp. 75-84

Voir la notice de l'article provenant de la source Library of Science

A graph is called supermagic if it admits a labeling of the edges by pairwise different 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 establish some conditions for graphs with a saturated vertex to be supermagic. Inter alia we show that complete multipartite graphs K1,n,n and K1,2,...,2 are supermagic.
Keywords: supermagic graph, saturated vertex, vertex-magic total labeling 
@article{DMGT_2014_34_1_a5,
     author = {Ivan\v{c}o, Jaroslav and Poll\'akov\'a, Tatiana},
     title = {Supermagic {Graphs} {Having} a {Saturated} {Vertex}},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {75--84},
     publisher = {mathdoc},
     volume = {34},
     number = {1},
     year = {2014},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2014_34_1_a5/}
}
TY  - JOUR
AU  - Ivančo, Jaroslav
AU  - Polláková, Tatiana
TI  - Supermagic Graphs Having a Saturated Vertex
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2014
SP  - 75
EP  - 84
VL  - 34
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2014_34_1_a5/
LA  - en
ID  - DMGT_2014_34_1_a5
ER  - 
%0 Journal Article
%A Ivančo, Jaroslav
%A Polláková, Tatiana
%T Supermagic Graphs Having a Saturated Vertex
%J Discussiones Mathematicae. Graph Theory
%D 2014
%P 75-84
%V 34
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2014_34_1_a5/
%G en
%F DMGT_2014_34_1_a5
Ivančo, Jaroslav; Polláková, Tatiana. Supermagic Graphs Having a Saturated Vertex. Discussiones Mathematicae. Graph Theory, Tome 34 (2014) no. 1, pp. 75-84. http://geodesic.mathdoc.fr/item/DMGT_2014_34_1_a5/