- Title
- Super antimagic total labeling of graphs
- Creator
- Sugeng, Kiki Ariyanti; Miller, Mirka; Baca, Martin
- Date
- 2008
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/65525
- Identifier
- vital:848
- Identifier
- ISSN:0315-3681
- Abstract
- Let G = (V, E) be a simple, finite and undirected graph with v vertices and e edges, A graph labeling is a mapping from elements of a graph to a set of numbers (usually positive integers). If the domain of the mapping is the set of vertices (or edges) then the labeling is called vertex-labeling (or edge-labeling). If the domain of the mapping is the set of vertices and edges then the labeling is called total labeling. The sum of all labels associated with a graph element is called the weight of the element. If the weights of vertices (or the weights of edges) form an arithmetic progression starting at a and with difference d, then the labeling is called (a, d)-vertex-antimagic (or (a, d)-edge-antimagic). Such a labeling is called v-super (or e-super) if the smallest labels appear on the vertices (or edges). In this paper we present new results for v-super vertex-antimagic total and e-super edge-antimagic total labeling.; C1
- Publisher
- Utilitas Mathematica Publishing Incorporated
- Relation
- Utilitas Mathematica Vol. 76, no. (2008), p. 161-171
- Rights
- Copyright Utilitas Mathematica Publishing Incorporated
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0101 Pure Mathematics; Antimagic labeling
- Reviewed
- Hits: 775
- Visitors: 757
- Downloads: 0