The Group of Symmetries of the Tower of Hanoi Graph
From MaRDI portal
Publication:3060163
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.
Recommendations
- On the group and graph symmetries
- Symmetries of the honeycomb toroidal graphs
- scientific article; zbMATH DE number 4198322
- 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
Cited in
(5)
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)