- Title
- Antimagic labeling of disjoint union of s-crowns
- Creator
- Baca, Martin; Dafik; Miller, Mirka; Ryan, Joe
- Date
- 2009
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/39316
- Identifier
- vital:1912
- Identifier
- ISSN:0315-3681
- Abstract
- A graph G is called (a, d)-edge-antimagic total if it admits a labeling of the vertices and edges by pairwise distinct integers of 1,2,..., |V(G)| + |E(G)| such that the edge-weights, w(uυ) = f(u) + f(υ) + f(uυ), uv ∈ E(G), form an arithmetic sequence with the first term a and common difference d. Such a graph G is called super if the smallest possible labels appear on the vertices. A construction of super (a, d)-edge-antimagic total labelings of some disconnected graphs are described.
- Relation
- Utilitas Mathematica Vol. 79, no. (2009), p. 193-205
- Rights
- Copyright Utilitas Mathematica Publishing Inc.
- Rights
- This metadata is freely available under a CCO license
- Subject
- (A,d)-edge-antimagic total labeling; S-crowns; Super (a,d)-edge-antimagic total labeling
- Reviewed
- Hits: 1097
- Visitors: 1050
- Downloads: 0