Abstract
This paper provides constructions of antimagic labelings of two families of graphs, namely, sequential generalized corona graphs and generalized snowflake graphs. The labelings can also be used for some families of antimagic trees which are special cases of these families. Future lines of research for antimagic graph labelings are proposed.
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)
Arumugam S., Miller M., Phanalasy O., Ryan J.: Antimagic labeling of generalized pyramid graphs. Acta Math. Sin. (Engl. Ser.) 30(2), 283–290 (2014)
Bača M., Miller M.: Super Edge-Antimagic Graphs: A Wealth of Problems and Some Solutions. Brown Walker Press, Boca Raton (2008)
Bloom G.S., Golomb S.W.: Applications of numbered undirected graphs. Proc. IEEE 65, 562–570 (1977)
Bloom, G.S., Golomb, S.W.: Numbered complete graphs, unusual rulers and assorted applications. In: Theory and Applications of Graphs. Lecture Notes in Mathematics, vol. 642, pp. 53–65. Springer, New York (1978)
Gallai, T.: Transitiv orientierbare Graphen. Acta Math. Acad. Sci. Hung. 18, 25–66 (1967). doi:10.1007/BF02020961. MR 0221974
Gallian, J.A.: A dynamic survey of graph labeling. Electron. J. Combin. 19 (\({\sharp}\)DS6), 1–380 (2013)
Hartsfield, N., Ringel G.: Pearls in Graph Theory: A Comprehensive Introduction. Academic Press Inc., Boston (1990)
Hawick K.A., Leist A., Playne D.P.: Parallel graph component labelling with GPUs and CUDA. Parallel Comput. 36(12), 655–678 (2010)
Krishnaa A.: A study of the major graph labelings of trees. Informatica 15(4), 515–524 (2004)
Miller M., Phanalasy O., Ryan J., Rylands L.: Sparse graphs with vertex antimagic edge labelings. AKCE Int. J. Graphs Comb. 10(2), 193–198 (2013)
O’Connell, T.C.: A survey of graph algorithms in extensions to the streaming model of computation. http://www.skidmore.edu/~toconnel/pub/oconnellGraphStream.pdf
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 labelling for graphs. Discrete Math. 308, 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
Additional information
M. Miller was supported by a Marie Curie International Incoming Fellowship within the 7th European Community Framework Programme.
Rights and permissions
About this article
Cite this article
Daykin, J.W., Iliopoulos, C.S., Miller, M. et al. Antimagicness of Generalized Corona and Snowflake Graphs. Math.Comput.Sci. 9, 105–111 (2015). https://doi.org/10.1007/s11786-014-0213-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11786-014-0213-x