Skip to main content

On Super Edge-Antimagic Total Labeling of Toeplitz Graphs

  • Conference paper
  • First Online:
Book cover Mathematics in the 21st Century

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 98))

  • 1766 Accesses

Abstract

A graph G of order p and size q is called (a, d)-edge-antimagic total if there exists a bijective function \(f: V (G) \cup E(G) \rightarrow \{ 1,2,\ldots,p + q\}\) such that the edge-weights \(wt_{f}(uv) = f(u) + f(uv) + f(v)\), uv ∈ E(G), form an arithmetic sequence with first term a and common difference d. The (a, d)-edge-antimagic total graph G is called super if the smallest possible labels appear on the vertices. In this paper, we study the existence of such labelings for Toeplitz graphs for several differences d.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The research for this article was supported by Slovak VEGA Grant 1/0130/12 and Higher Education Commission Pakistan Grant HEC(FD)/2007/555.

References

  1. Bača, M., Lin, Y., Muntaner-Batle, F.A.: Super edge-antimagic labelings of the path-like trees. Util. Math. 73, 117–128 (2007)

    MATH  MathSciNet  Google Scholar 

  2. Bača, M., Lin, Y., Muntaner-Batle, F.A.: A note on even disjoint union of paths. AKCE J. Graphs. Comb. 6(1), 41–46 (2009)

    MATH  Google Scholar 

  3. Bača, M., Miller, M.: Super Edge-Antimagic Graphs. BrownWalker Press, Boca Raton (2008)

    Google Scholar 

  4. van Dal, R., Tijssen, G., Tuza, Z., van der Veen, J., Zamfirescu, C.H., Zamfirescu, T.: Hamiltonian properties of Toeplitz graphs. Discret. Math. 159, 69–81 (1996)

    Article  MATH  Google Scholar 

  5. Enomoto, H., Lladó, A.S., Nakamigawa, T., Ringel, G.: Super edge-magic graphs. SUT J. Math. 34, 105–109 (1998)

    MATH  MathSciNet  Google Scholar 

  6. Euler, R., LeVerge, H., Zamfirescu, T.: A characterization of infinite, bipartite Toeplitz graphs. In: Tung-Hsin, K. (ed.) Combinatorics and Graph Theory’95, Vol. 1. Academia Sinica, pp. 119–130. World Scientific, Singapore (1995)

    Google Scholar 

  7. Euler, R.: Characterizing bipartite Toeplitz graphs. Theor. Comput. Sci. 263, 47–58 (2001)

    Article  MATH  Google Scholar 

  8. Euler, R.: Coloring planar Toeplitz graphs and the stable set polytope. Discret. Math. 276, 183–200 (2004)

    Article  MATH  Google Scholar 

  9. Euler, R., Zamfirescu, T.: On planar Toeplitz graphs. Graphs Comb. (2012). doi:10.1007/s00373-012-1185-8

    Google Scholar 

  10. Figueroa-Centeno, R.M., Ichishima, R., Muntaner-Batle, F.A.: The place of super edge-magic labelings among other classes of labelings. Discret. Math. 231, 153–168 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  11. Figueroa-Centeno, R.M., Ichishima, R., Muntaner-Batle, F.A.: On edge-magic labelings of certain disjoint unions of graphs. Australas. J. Comb. 32, 225–242 (2005)

    MATH  MathSciNet  Google Scholar 

  12. Gallian, J.: A dynamic survey of graph labeling. Electron. J. Comb. 19, #DS6 (2012)

    Google Scholar 

  13. Heuberger, C.: On Hamiltonian Toeplitz graphs. Discret. Math. 245, 107–125 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  14. Heuberger, C.: On planarity and colorability of circulant graphs. Discret. Math. 268, 153–169 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  15. Kotzig, A., Rosa, A.: Magic valuations of finite graphs. Can. Math. Bull. 13, 451–461 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  16. Malik, S., Qureshi, A.M.: Hamiltonian cycles in directed Toeplitz graphs. Ars Comb. 109, 511–526 (2013)

    MATH  MathSciNet  Google Scholar 

  17. Malik, S., Zamfirescu, T.: Hamiltonian connectedness in directed Toeplitz graphs. Bull. Math. Soc. Sci. Math. Roum. 53(2), 145–156 (2010)

    MathSciNet  Google Scholar 

  18. Nicoloso, S., Pietropaoli, U.: On the chromatic number of Toeplitz graphs. Discret. Appl. Math. (2012). doi:10.1016/j.dam.2011.07.012

    MATH  Google Scholar 

  19. Simanjuntak, R., Bertault, F., Miller, M.: Two new (a, d)-antimagic graph labelings. In: Proceedings of Eleventh Australasian Workshop on Combinatorial Algorithms, Hunter Valley, pp. 179–189 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Martin Bača .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer Basel

About this paper

Cite this paper

Bača, M., Bashir, Y., Nadeem, M.F., Shabbir, A. (2015). On Super Edge-Antimagic Total Labeling of Toeplitz Graphs. In: Cartier, P., Choudary, A., Waldschmidt, M. (eds) Mathematics in the 21st Century. Springer Proceedings in Mathematics & Statistics, vol 98. Springer, Basel. https://doi.org/10.1007/978-3-0348-0859-0_1

Download citation

Publish with us

Policies and ethics