Vertex-antimagic total labelings of graphs

Martin Bača; James A. MacDougall; François Bertault; Mirka Miller; Rinovia Simanjuntak; Slamin

Discussiones Mathematicae Graph Theory (2003)

  • Volume: 23, Issue: 1, page 67-83
  • ISSN: 2083-5892

Abstract

top
In this paper we introduce a new type of graph labeling for a graph G(V,E) called an (a,d)-vertex-antimagic total labeling. In this labeling we assign to the vertices and edges the consecutive integers from 1 to |V|+|E| and calculate the sum of labels at each vertex, i.e., the vertex label added to the labels on its incident edges. These sums form an arithmetical progression with initial term a and common difference d. We investigate basic properties of these labelings, show their relationships with several other previously studied graph labelings, and show how to construct labelings for certain families of graphs. We conclude with several open problems suitable for further research.

How to cite

top

Martin Bača, et al. "Vertex-antimagic total labelings of graphs." Discussiones Mathematicae Graph Theory 23.1 (2003): 67-83. <http://eudml.org/doc/270428>.

@article{MartinBača2003,
abstract = { In this paper we introduce a new type of graph labeling for a graph G(V,E) called an (a,d)-vertex-antimagic total labeling. In this labeling we assign to the vertices and edges the consecutive integers from 1 to |V|+|E| and calculate the sum of labels at each vertex, i.e., the vertex label added to the labels on its incident edges. These sums form an arithmetical progression with initial term a and common difference d. We investigate basic properties of these labelings, show their relationships with several other previously studied graph labelings, and show how to construct labelings for certain families of graphs. We conclude with several open problems suitable for further research. },
author = {Martin Bača, James A. MacDougall, François Bertault, Mirka Miller, Rinovia Simanjuntak, Slamin},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {super-magic labeling; (a,d)-vertex-antimagic total labeling; (a,d)-antimagic labeling; graph labeling; antimagic labeling; -vertex-antimagic total labeling},
language = {eng},
number = {1},
pages = {67-83},
title = {Vertex-antimagic total labelings of graphs},
url = {http://eudml.org/doc/270428},
volume = {23},
year = {2003},
}

TY - JOUR
AU - Martin Bača
AU - James A. MacDougall
AU - François Bertault
AU - Mirka Miller
AU - Rinovia Simanjuntak
AU - Slamin
TI - Vertex-antimagic total labelings of graphs
JO - Discussiones Mathematicae Graph Theory
PY - 2003
VL - 23
IS - 1
SP - 67
EP - 83
AB - In this paper we introduce a new type of graph labeling for a graph G(V,E) called an (a,d)-vertex-antimagic total labeling. In this labeling we assign to the vertices and edges the consecutive integers from 1 to |V|+|E| and calculate the sum of labels at each vertex, i.e., the vertex label added to the labels on its incident edges. These sums form an arithmetical progression with initial term a and common difference d. We investigate basic properties of these labelings, show their relationships with several other previously studied graph labelings, and show how to construct labelings for certain families of graphs. We conclude with several open problems suitable for further research.
LA - eng
KW - super-magic labeling; (a,d)-vertex-antimagic total labeling; (a,d)-antimagic labeling; graph labeling; antimagic labeling; -vertex-antimagic total labeling
UR - http://eudml.org/doc/270428
ER -

References

top
  1. [1] M. Bača, I. Holländer and Ko-Wei Lih, Two classes of super-magic quartic graphs, JCMCC 13 (1997) 113-120. Zbl0876.05085
  2. [2] M. Bača and I. Holländer, On (a,d)-antimagic prisms, Ars. Combin. 48 (1998) 297-306. 
  3. [3] R. Bodendiek and G. Walther, Arithmetisch antimagische graphen, in: K. Wagner and R. Bodendiek, Graphentheorie III, (BI-Wiss. Verl., Mannheim-Leipzig-Wien-Zürich, 1993). 
  4. [4] M. Doob, Generalizations of magic graphs, J. Combin. Theory (B) 17 (1974) 205-217, doi: 10.1016/0095-8956(74)90027-6. Zbl0271.05128
  5. [5] J.A. Gallian, A dynamic survey of graph labeling, Electronic. J. Combin. 5 (1998) #DS6. Zbl0953.05067
  6. [6] N. Hartsfield and G. Ringel, Pearls in Graph Theory (Academic Press, Boston-San Diego-New York-London, 1990). Zbl0703.05001
  7. [7] R.H. Jeurissen, Magic graphs, a characterization, Report 8201 (Mathematisch Instituut, Katholieke Universiteit Nijmegen, 1982). Zbl0657.05065
  8. [8] S. Jezný and M. Trenkler, Charaterization of magic graphs, Czechoslovak Math. J. 33 (1983) 435-438. Zbl0571.05030
  9. [9] A. Kotzig and A. Rosa, Magic valuations of finite graphs, Canad. Math. Bull. 13 (1970) 451-461, doi: 10.4153/CMB-1970-084-1. Zbl0213.26203
  10. [10] J.A. MacDougall, M. Miller, Slamin, and W.D. Wallis, Vertex-magic total labelings of graphs, Utilitas Math., to appear. Zbl1008.05135
  11. [11] M. Miller and M. Bača, Antimagic valuations of generalized Petersen graphs, Australasian J. Combin. 22 (2000) 135-139. Zbl0971.05098
  12. [12] J. Sedlácek, Problem 27 in Theory of Graphs and its Applications, Proc. Symp. Smolenice, June 1963, Praha (1964), p. 162. 
  13. [13] B.M. Stewart, Supermagic complete graphs, Can. J. Math. 19 (1967) 427-438, doi: 10.4153/CJM-1967-035-9. Zbl0162.27801
  14. [14] W.D. Wallis, E.T. Baskoro, M. Miller and Slamin, Edge-magic total labelings of graphs, Australasian J. Combin. 22 (2000) 177-190. Zbl0972.05043
  15. [15] D.B. West, An Introduction to Graph Theory (Prentice-Hall, 1996). Zbl0845.05001

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.