- Title
- Antimagic labelings of join graphs
- Creator
- Bača, Martin; Phanalasy, Oudone; Ryan, Joe; Semaničová-Feňovčíková, Andrea
- Relation
- Mathematics in Computer Science Vol. 9, Issue 2, p. 139-143
- Publisher Link
- http://dx.doi.org/10.1007/s11786-015-0218-0
- Publisher
- Springer
- Resource Type
- journal article
- Date
- 2015
- Description
- An antimagic labeling of a graph with q edges is a bijection from the set of edges of the graph to the set of positive integers {1,2,...,q} such that all vertex weights are pairwise distinct, where a vertex weight is the sum of labels of all edges incident with the vertex. The join graph G + H of the graphs G and H is the graph with V(G+H)=V(G)∪V(H) and E(G=H)=E(G)∪E(H)∪{uv : u∈V(G) and v∈V(H)}. The complete bipartite graph Km,n is an example of join graphs and we give an antimagic labeling for Km,n,n≥2m+1. In this paper we also provide constructions of antimagic labelings of some complete multipartite graphs.
- Subject
- antimagic labeling
- Identifier
- http://hdl.handle.net/1959.13/1339550
- Identifier
- uon:28280
- Identifier
- ISSN:1661-8270
- Language
- eng
- Reviewed
- Hits: 821
- Visitors: 813
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|