The Group of Symmetries of the Tower of Hanoi Graph

DOI10.4169/000298910X480829zbMATH Open1200.05026DBLPjournals/tamm/Park10arXiv0809.1179OpenAlexW2962750600WikidataQ58133710 ScholiaQ58133710MaRDI QIDQ3060163FDOQ3060163

Authors: So Eun Park 

Publication date: 1 December 2010

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Abstract: I prove that the group of symmetries of the Tower of Hanoi graph with k pegs and n disks, denoted H_n^k, is isomorphic to the group of permutations of k elements, S_k, for all k greater than or equal to 3 and positive n.

Full work available at URL: https://arxiv.org/abs/0809.1179

Recommendations

• On the group and graph symmetries
• Symmetries of the honeycomb toroidal graphs
• scientific article
• The Symmetry Group of the Permutahedron
• The complete symmetry group of the generalised hyperladder problem
• Symmetry Groups of Coloured Graphs
• scientific article; zbMATH DE number 3889559
• Symmetries of finite graphs and homology
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• Some groups related to the symmetry of a directed graph

zbMATH Keywords

group of automorphismsTower of Hanoi graph

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)

Cited In (5)

• A survey and classification of Sierpiński-type graphs
• Twin towers of Hanoi
• The number of moves of the largest disc in shortest paths on Hanoi graphs
• The weighted tower of Hanoi
• Sierpiński graphs as spanning subgraphs of Hanoi graphs

This page was built for publication: The Group of Symmetries of the Tower of Hanoi Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3060163)