- Title
- Edge-antimagic graphs
- Creator
- Baca, Martin; Lin, Yuqing; Miller, Mirka; Youssef, Maged
- Date
- 2007
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/36369
- Identifier
- vital:64
- Identifier
-
https://doi.org/10.1016/j.disc.2005.10.038
- Identifier
- ISSN:0012-365X
- Abstract
- For a graph G = (V, E), a bijection g from V(G) boolean OR E(G) into {1, 2,..., vertical bar V(G)vertical bar + vertical bar E(G)vertical bar} is called (a, d)-edge-antimagic total labeling of G if the edge-weights w(xy) = g(x) + g(y) + g(xy), xy E E(G), form an arithmetic progression starting from a and having common difference d. An (a, d)-edge-antimagic total labeling is called super (a, d)-edge-antimagic total if g(V(G)) = {1, 2,..., vertical bar V(G)vertical bar}. We study super (a, d)-edge-antimagic properties of certain classes of graphs, including friendship graphs, wheels, fans, complete graphs and complete bipartite graphs. (c) 2006 Elsevier B.V. All rights reserved.
- Publisher
- Elsevier
- Relation
- Discrete Mathematics Vol. 307, no. 11-12 (May 2007), p. 1232-1244
- Rights
- Copyright Elsevier
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0101 Pure Mathematics; Edge-antimagic labeling; Edge-weight
- Reviewed
- Hits: 1030
- Visitors: 1019
- Downloads: 2
| Thumbnail | File | Description | Size | Format |
|---|