the outer - connected domination number of sierpinski - like graphs .
Shortest paths in the Tower of Hanoi graph and finite automata