- Title
- Antimagicness of some families of generalized graphs
- Creator
- Miller, Mirka; Phanalasy, Oudone; Ryan, Joe; Rylands, Leanne
- Relation
- Australasian Journal of Combinatorics Vol. 53, p. 179-190
- Relation
- http://ajc.maths.uq.edu.au/?page=get_volumes&volume=53
- Publisher
- Centre for Discrete Mathematics & Computing
- Resource Type
- journal article
- Date
- 2012
- Description
- An edge labeling of a graph G = (V,E) is a bijection from the set of edges to the set of integers {1, 2,..., ∣E∣}. The weight of a vertex v is the sum of the labels of all the edges incident with v. If the vertex weights are all distinct then we say that the labeling is vertex-antimagic, or simply, antimagic. A graph that admits an antimagic labeling is called an antimagic graph. In this paper, we present a new general method of constructing families of graphs with antimagic labelings. In particular, our method allows us to prove that generalized web graphs and generalized flower graphs are antimagic.
- Subject
- edge labeling; antimagic; generalized graphs
- Identifier
- http://hdl.handle.net/1959.13/1308080
- Identifier
- uon:21608
- Identifier
- ISSN:1034-4942
- Language
- eng
- Reviewed
- Hits: 990
- Visitors: 970
- Downloads: 0
Thumbnail | File | Description | Size | Format |
---|