## Adjacency matrix[Too large to display] |
## Adjacency list[Too large to display] |

44071

Hanoi graph 2 discs, 5 spindles, linear

Kevin Ryde

Invariant | Value | Invariant | Value |
---|---|---|---|

Acyclic | No | Index | 2.878 |

Algebraic Connectivity | 0.121 | Laplacian Largest Eigenvalue | 6.085 |

Average Degree | 2.56 | Longest Induced Cycle | 16 |

Bipartite | Yes | Longest Induced Path | 16 |

Chromatic Index | 4 | Matching Number | 12 |

Chromatic Number | 2 | Maximum Degree | 4 |

Circumference | 20 | Minimum Degree | 1 |

Claw-Free | No | Minimum Dominating Set | 8 |

Clique Number | 2 | Number of Components | 1 |

Connected | Yes | Number of Edges | 32 |

Density | 0.107 | Number of Triangles | 0 |

Diameter | 12 | Number of Vertices | 25 |

Edge Connectivity | 1 | Planar | Yes |

Eulerian | No | Radius | 6 |

Genus | 0 | Regular | No |

Girth | 4 | Second Largest Eigenvalue | 2.755 |

Hamiltonian | No | Smallest Eigenvalue | -2.878 |

Independence Number | 13 | Vertex Connectivity | 1 |

A table row rendered like this
indicates that the graph is marked as being *interesting* for that invariant.

Posted by Kevin Ryde at Dec 15, 2020 8:17 AM.

Each vertex is a configuration of discs on spindles for a variation of the Towers of Hanoi puzzle with 5 spindles in a row and discs only moved forward or backward between adjacent spindles.

The two degree-1 vertices are the 2 discs on the first or last spindle. The degree-2 vertices are 2 discs on another spindle.

The two degree-1 vertices are the 2 discs on the first or last spindle. The degree-2 vertices are 2 discs on another spindle.

You need to be logged in to be able to add comments.