Skip to main content
SpringerLink
Log in

Sierpiński graphs as spanning subgraphs of Hanoi graphs

  • Research Article
  • Published:
Central European Journal of Mathematics

Abstract

Hanoi graphs H n p model the Tower of Hanoi game with p pegs and n discs. Sierpinski graphs S n p arose in investigations of universal topological spaces and have meanwhile been studied extensively. It is proved that S n p embeds as a spanning subgraph into H n p if and only if p is odd or, trivially, if n = 1.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Arett D., Dorée S., Coloring and counting on the Tower of Hanoi graphs, Math. Mag., 2010, 83, 200–209

    Article  MathSciNet  MATH  Google Scholar 

  2. Beaudou L., Gravier S., Klavžar S., Kovše M., Mollard M., Covering codes in Sierpinski graphs, Discrete Math. Theor. Comput. Sci., 2010, 12(3), 63–74

    MathSciNet  Google Scholar 

  3. Chen X., Shen J., On the Frame-Stewart conjecture about the Towers of Hanoi, SIAM J. Comput., 2004, 33(3), 584–589

    Article  MathSciNet  MATH  Google Scholar 

  4. Fu H.-Y., Xie D., Equitable L(2, 1)-labelings of Sierpinski graphs, Australas. J. Combin., 2010, 46, 147–156

    MathSciNet  MATH  Google Scholar 

  5. Hinz A.M., The Tower of Hanoi, Enseign. Math., 1989, 35(3–4), 289–321

    MathSciNet  MATH  Google Scholar 

  6. Hinz A.M., Parisse D., On the planarity of Hanoi graphs, Expo. Math., 2002, 20(3), 263–268

    Article  MathSciNet  MATH  Google Scholar 

  7. Hinz A.M., Parisse D., Coloring Hanoi and Sierpinski graphs, Discrete Math., 2012, 312(9), 1521–1535

    Article  MathSciNet  MATH  Google Scholar 

  8. Hinz A.M., Parisse D., The average eccentricity of Sierpinski graphs, Graphs Combin., 2012, 28(5), 671–686

    Article  MathSciNet  MATH  Google Scholar 

  9. Imrich W., Klavžar S., Rall D.F., Topics in Graph Theory, AK Peters, Wellesley, 2008

    MATH  Google Scholar 

  10. Klavžar S., Milutinovic U., Graphs S(n, k) and a variant of the Tower of Hanoi problem, Czechoslovak Math. J., 1997, 47(122)(1), 95–104

    Article  MathSciNet  MATH  Google Scholar 

  11. Klavžar S., Milutinovic U., Petr C., On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem, Discrete Appl. Math., 2002, 120(1–3), 141–157

    Article  MathSciNet  MATH  Google Scholar 

  12. Lin C.-H., Liu J.-J., Wang Y.-L., Yen W.C.-K., The hub number of Sierpinski-like graphs, Theory Comput. Syst., 2011, 49(3), 588–600

    Article  MathSciNet  MATH  Google Scholar 

  13. Lipscomb S.L., Fractals and Universal Spaces in Dimension Theory, Springer Monogr. Math., Springer, New York, 2009

    Book  MATH  Google Scholar 

  14. Milutinovic U., Completeness of the Lipscomb universal space, Glas. Mat., 1992, 27(47)(2), 343–364

    MathSciNet  MATH  Google Scholar 

  15. Parisse D., On some metric properties of the Sierpinski graphs S n k , Ars Combin., 2009, 90, 145–160

    MathSciNet  MATH  Google Scholar 

  16. Park S.E., The group of symmetries of the Tower of Hanoi graph, Amer. Math. Monthly, 2010, 117(4), 353–360

    Article  MathSciNet  MATH  Google Scholar 

  17. Romik D., Shortest paths in the Tower of Hanoi graph and finite automata, SIAM J. Discrete Math., 2006, 20(3), 610–622

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Institute, LMU München, Theresienstraße 39, 80333, München, Germany

    Andreas M. Hinz

  2. Faculty of Mathematics and Physics, University of Ljubljana, Jadranska 19, 1000, Ljubljana, Slovenia

    Sandi Klavžar

  3. Faculty of Natural Sciences and Mathematics, University of Maribor, Koroška 160, 2000, Maribor, Slovenia

    Sandi Klavžar

  4. Institute of Mathematics, Physics and Mechanics, Jadranska 19, 1000, Ljubljana, Slovenia

    Sara Sabrina Zemljič

Authors
  1. Andreas M. Hinz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sandi Klavžar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sara Sabrina Zemljič
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andreas M. Hinz.

About this article

Cite this article

Hinz, A.M., Klavžar, S. & Zemljič, S.S. Sierpiński graphs as spanning subgraphs of Hanoi graphs. centr.eur.j.math. 11, 1153–1157 (2013). https://doi.org/10.2478/s11533-013-0227-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.2478/s11533-013-0227-7

MSC

Keywords

Search

Navigation