Skip to main content
Log in

On Planar Toeplitz Graphs

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We describe several classes of finite, planar Toeplitz graphs and present results on their chromatic number. We then turn to counting maximal independent sets in these graphs and determine recurrence equations and generating functions for some special cases.

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. Chen J.-J., Chang G.J., Huang K.-C.: Integral distance graphs. J. Graph Theory 25, 287–294 (1997)

    Article  MathSciNet  MATH  Google Scholar 

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

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

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  5. Euler, R.: The Fibonacci number of a grid graph and a new class of integer sequences. J. Integer Seq. 8 (2005) (Article 05.2.6)

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

    Google Scholar 

  7. Füredi Z.: The number of maximal independent sets in connected graphs. J. Graph Theory 11, 463–470 (1987)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Kemnitz A., Marangio M.: Chromatic numbers of integer distance graphs. Discret. Math. 233, 239–246 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  11. Malik, S. Qureshi, A.M.: Hamiltonian cycles in directed Toeplitz graphs. Ars Combin. (to appear)

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

    MathSciNet  Google Scholar 

  13. Moon J.W., Moser L.: On cliques in graphs. Israel J. Math. 3, 23–28 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  14. Nicoloso, S., Pietropaoli, U.: On the chromatic number of Toeplitz graphs. Working Paper R.10-13, IASI-CNR, 10/2010, Discret. Appl. Math. (to appear)

  15. Stanley R.P.: Enumerative Combinatorics, vol.1. Cambridge University Press, New York (1997)

    Book  MATH  Google Scholar 

  16. Vadhan S.P.: The complexity of counting in sparse, regular and planar graphs. SIAM J. Comput. 31, 398–427 (2001)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Reinhardt Euler.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Euler, R., Zamfirescu, T. On Planar Toeplitz Graphs. Graphs and Combinatorics 29, 1311–1327 (2013). https://doi.org/10.1007/s00373-012-1185-8

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-012-1185-8

Keywords

Mathematics Subject Classification

Navigation