Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/915979
- Title
- Super-vertex-antimagic total labelings of disconnected graphs
- Author/Creator
-
Ali, Gohar;
Bača, Martin;
Lin, Yuqing;
Semaničová-Feňovčíková, Andrea
- Institution
- The University of Newcastle. Faculty of Engineering & Built Environment, School of Electrical Engineering and Computer Science
- Description
- Let G = (V,E) be a finite, simple and non-empty (p,q)-graph of order p and size q. An (a,d)-vertex-antimagic total labeling is a bijection f from V(G)⋃E(G) onto the set of consecutive integers 1,2,…,p+q, such that the vertex-weights form an arithmetic progression with the initial term a and the common difference d, where the vertex-weight of x is the sum of values f(xy) assigned to all edges xy incident to vertex x together with the value assigned to x itself, i.e. f(x). Such a labeling is called super if the smallest possible labels appear on the vertices. In this paper, we will study the properties of such labelings and examine their existence for disconnected graphs.
- Relation
- Discrete Mathematics Vol. 309, Issue 20, p. 6048-6054
- Publisher Link
- http://dx.doi.org/10.1016/j.disc.2009.05.005
- Date
- 2009
- Publisher
- Elsevier
- Keyword(s)
-
(a,d)-vertex-antimagic total labeling;
super-(a,d)-vertex-antimagic total labeling;
disconnected graphs
- Resource Type
- journal article
- Identifier
- http://hdl.handle.net/1959.13/915979
- Identifier
- ISSN:0012-365X
- Reviewed
44 Visitors
55 Hits
0 Downloads
