A recursively scalable network VLSI implementation
Future Generation Computer Systems
Pascal's triangle and the tower of Hanoi
American Mathematical Monthly
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
Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
European Journal of Combinatorics
Shortest Paths in the Tower of Hanoi Graph and Finite Automata
SIAM Journal on Discrete Mathematics
Hamiltonian connectivity of the WK-recursive network with faulty nodes
Information Sciences: an International Journal
Crossing numbers of Sierpiński-like graphs
Journal of Graph Theory
Information Processing Letters
The Hub Number of Sierpiński-Like Graphs
Theory of Computing Systems
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
The Tower of Hanoi - Myths and Maths
The Tower of Hanoi - Myths and Maths
| Hi-index | 0.04 |
In [23], Klavzar and Milutinovic (1997) proved that there exist at most two different shortest paths between any two vertices in Sierpinski graphs S"k^n, and showed that the number of shortest paths between any fixed pair of vertices of S"k^n can be computed in O(n). An almost-extreme vertex of S"k^n, which was introduced in Klavzar and Zemljic (2013) [27], is a vertex that is either adjacent to an extreme vertex or incident to an edge between two subgraphs of S"k^n isomorphic to S"k^n^-^1. In this paper, we completely determine the set S"u={v@?V(S"k^n):there exist two shortest u,v-paths in S"k^n}, where u is any almost-extreme vertex of S"k^n.