Pascal's triangle and the tower of Hanoi
American Mathematical Monthly
The ring of k-regular sequences
Theoretical Computer Science
Shortest paths between regular states of the tower of Hanoi
Information Sciences: an International Journal
Error-correcting codes on the towers of Hanoi graphs
Discrete Mathematics
Points recurring: the history of a railway problem
ACM SIGPLAN Notices
A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles
Information Sciences: an International Journal
DES modelling and control vs. problem solving methods
International Journal of Intelligent Information and Database Systems
Linking the Calkin-Wilf and Stern-Brocot trees
European Journal of Combinatorics
Restricted towers of hanoi and morphisms
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
The hamiltonicity and path t-coloring of Sierpiński-like graphs
Discrete Applied Mathematics
Hamming dimension of a graph-The case of Sierpiński graphs
European Journal of Combinatorics
Finding the edge ranking number through vertex partitions
Discrete Applied Mathematics
Shortest paths in Sierpiński graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
It is known that in the Tower of Hanoi graphs there are at most two different shortest paths between any fixed pair of vertices. A formula is given that counts, for a given vertex v, the number of vertices u such that there are two shortest u, v-paths. The formula is expressed in terms of Stern's diatomic sequence b(n) (n ≥ 0) and implies that only for vertices of degree two this number is zero. Plane embeddings of the Tower of Hanoi graphs are also presented that provide an explicit description of b(n) as the number of elements of the sets of vertices of the Tower of Hanoi graphs intersected by certain lines in the plane.