Graph details
|
|
Adjacency matrix[Too large to display] |
Adjacency list[Too large to display] |
HoG graph id
44109
Graph name
Hanoi Exchanging Discs, 5 Discs
Graph submitted by
Kevin Ryde
Invariant values
The definitions of the invariants can be found here.| Invariant | Value | Invariant | Value |
|---|---|---|---|
| Acyclic | No | Index | 3.222 |
| Algebraic Connectivity | 0.007 | Laplacian Largest Eigenvalue | 6.472 |
| Average Degree | 2.988 | Longest Induced Cycle | Computation time out |
| Bipartite | No | Longest Induced Path | Computation time out |
| Chromatic Index | Computation time out | Matching Number | 121 |
| Chromatic Number | Computation time out | Maximum Degree | 4 |
| Circumference | Computation time out | Minimum Degree | 2 |
| Claw-Free | No | Minimum Dominating Set | Computation time out |
| Clique Number | 3 | Number of Components | 1 |
| Connected | Yes | Number of Edges | 363 |
| Density | 0.012 | Number of Triangles | 81 |
| Diameter | 25 | Number of Vertices | 243 |
| Edge Connectivity | Computation time out | Planar | Computation time out |
| Eulerian | No | Radius | 17 |
| Genus | Computation time out | Regular | No |
| Girth | 3 | Second Largest Eigenvalue | 3.214 |
| Hamiltonian | Computation time out | Smallest Eigenvalue | -2.647 |
| Independence Number | Computation time out | Vertex Connectivity | Computation time out |
A table row rendered like this indicates that the graph is marked as being interesting for that invariant.
Comments
Posted by Kevin Ryde at Feb 23, 2021 8:47 AM.
Scorer, Grundy and Smith define a variation of the towers of Hanoi puzzle where the smallest disk moves freely and two disks can exchange positions when they differ in size by 1, are on different pegs, and each is top-most on its peg. Each vertex here is a configuration of discs on spindles. Each edge is a step (move or exchange) between configurations.
R. S. Scorer, P. M. Grundy and C. A. B. Smith, "Some Binary Games", The Mathematical Gazette, July 1944, volume 28, number 280, pages 96-103, http://www.jstor.org/stable/3606393. See section 4(iii).
Paul K. Stockmeyer et al, "Exchanging Disks in the Tower of Hanoi", International Journal of Computer Mathematics, volume 59, number 1-2, pages 37-47, 1995, http://www.cs.wm.edu/~pkstoc/gov.pdf, calculating the graph diameter (OEIS A341579).
R. S. Scorer, P. M. Grundy and C. A. B. Smith, "Some Binary Games", The Mathematical Gazette, July 1944, volume 28, number 280, pages 96-103, http://www.jstor.org/stable/3606393. See section 4(iii).
Paul K. Stockmeyer et al, "Exchanging Disks in the Tower of Hanoi", International Journal of Computer Mathematics, volume 59, number 1-2, pages 37-47, 1995, http://www.cs.wm.edu/~pkstoc/gov.pdf, calculating the graph diameter (OEIS A341579).
You need to be logged in to be able to add comments.