Skip to main content
Log in

Antimagicness of Generalized Corona and Snowflake Graphs

  • Published:
Mathematics in Computer Science Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Alon N., Kaplan G., Lev A., Roditty Y., Yuster R.: Dense graphs are antimagic. J. Graph Theory 47(4), 297–309 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  2. Arumugam S., Miller M., Phanalasy O., Ryan J.: Antimagic labeling of generalized pyramid graphs. Acta Math. Sin. (Engl. Ser.) 30(2), 283–290 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bača M., Miller M.: Super Edge-Antimagic Graphs: A Wealth of Problems and Some Solutions. Brown Walker Press, Boca Raton (2008)

    Google Scholar 

  4. Bloom G.S., Golomb S.W.: Applications of numbered undirected graphs. Proc. IEEE 65, 562–570 (1977)

    Article  Google Scholar 

  5. 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)

  6. Gallai, T.: Transitiv orientierbare Graphen. Acta Math. Acad. Sci. Hung. 18, 25–66 (1967). doi:10.1007/BF02020961. MR 0221974

  7. Gallian, J.A.: A dynamic survey of graph labeling. Electron. J. Combin. 19 (\({\sharp}\)DS6), 1–380 (2013)

  8. Hartsfield, N., Ringel G.: Pearls in Graph Theory: A Comprehensive Introduction. Academic Press Inc., Boston (1990)

  9. Hawick K.A., Leist A., Playne D.P.: Parallel graph component labelling with GPUs and CUDA. Parallel Comput. 36(12), 655–678 (2010)

    Article  MATH  Google Scholar 

  10. Krishnaa A.: A study of the major graph labelings of trees. Informatica 15(4), 515–524 (2004)

    MATH  MathSciNet  Google Scholar 

  11. 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)

    MATH  MathSciNet  Google Scholar 

  12. 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

  13. Rylands L., Phanalasy O., Ryan J., Miller M.: An application of completely separating systems to graph labeling. LNCS 8288, 376–387 (2013)

    Google Scholar 

  14. Wang T.M., Hsiao C.C.: On anti-magic labelling for graphs. Discrete Math. 308, 3624–3633 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  15. Zhang Y., Sun X.: The antimagicness of the Cartesian product of graphs. Theor. Comput. Sci. 410, 727–735 (2009)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mirka Miller.

Additional information

M. Miller was supported by a Marie Curie International Incoming Fellowship within the 7th European Community Framework Programme.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11786-014-0213-x

Keywords

Mathematics Subject Classification

Navigation