Author:
Xue Bing,Zuo Liancui,Li Guojun
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference42 articles.
1. Arett, D., Dorée, S.: Coloring on the Tower of Hanoi graphs. Math. Mag. 83, 200–209 (2010)
2. Beaudou, L., Gravier, S., Klavžar, S., Kovše, M., Mollard, M.: Covering codes in Sierpiński graphs. Discrete Math. Theor. Comput. Sci 12, 63–74 (2010)
3. Bode, J.P., Hinz, A.M.: Results and open problems on the Tower of Hanoi. Congr. Numer. 139, 113–122 (1999)
4. Bondy, J.A., Murty, U.S.: Graph Theory with Applicatons. North-Holland, New York (1976)
5. Chan, T.H.: A statistical analysis of the Towers of Hanoi problem. Int. J. Comput. Math. 28, 57–65 (1989)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Wiener index of Sierpiński-like graphs;Journal of Combinatorial Optimization;2017-12-16
2. Metric properties of Sierpin´ski-like graphs;Applied Mathematics and Computation;2017-03
3. A survey and classification of Sierpiński-type graphs;Discrete Applied Mathematics;2017-01