Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
