Abstract
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,\dots,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) \cup V(H)}\) and \({E(G + H) = E(G) \cup E(H) \cup \{uv : u \in V(G) {\rm and} v \in V(H)\}}\). The complete bipartite graph K m,n is an example of join graphs and we give an antimagic labeling for \({K_{m,n}, n \geq 2m + 1}\). In this paper we also provide constructions of antimagic labelings of some complete multipartite graphs.
Similar content being viewed by others
References
Alon N., Kaplan G., Lev A., Roditty Y., Yuster R.: Dense graphs are antimagic. J. Graph Theory 47(4), 297–309 (2004)
Bača M., Miller M.: Super Edge-Antimagic Graphs: A Wealth of Problems and Some Solutions. BrownWalker Press, Boca Raton (2008)
Bača M., Miller M., Phanalasy O., Semaničová-Feňovčíková A.: Constructions of antimagic labelings for some families of regular graphs. J. Algorithms Comput. 44, 1–7 (2013)
Cheng Y.: A new class of antimagic Cartesian product graphs. Discrete Math. 308(24), 6441–6448 (2008)
Cranston D.W.: Regular bipartite graphs are antimagic. J. Graph Theory 60(3), 173–182 (2009)
Gallian, J.A.: A dynamic survey of graph labeling. Electron. J. Combin. 17(\({\sharp}\) DS6) (2014)
Hartsfield N., Ringel G.: Pearls in Graph Theory: A Comprehensive Introduction. Academic Press Inc., Boston (1990)
Phanalasy O., Miller M., Rylands L.J., Lieby P.: On a relationship between completely separating systems and antimagic labeling of regular graphs. LNCS 6460, 238–241 (2011)
Rylands L., Phanalasy O., Ryan J., Miller M.: An application of completely separating systems to graph labeling. LNCS 8288, 376–387 (2013)
Wang T.M., Hsiao C.C.: On anti-magic labeling for graph products. Discrete Math. 308(16), 3624–3633 (2008)
Zhang Y., Sun X.: The antimagicness of the Cartesian product of graphs. Theor. Comput. Sci. 410, 727–735 (2009)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bača, M., Phanalasy, O., Ryan, J. et al. Antimagic Labelings of Join Graphs. Math.Comput.Sci. 9, 139–143 (2015). https://doi.org/10.1007/s11786-015-0218-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11786-015-0218-0