Graph details
|
|
Adjacency matrix[Too large to display] |
Adjacency list[Too large to display] |
HoG graph id
49191
Graph name
n/a
Graph submitted by
House of Graphs
Invariant values
The definitions of the invariants can be found here.| Invariant | Value | Invariant | Value |
|---|---|---|---|
| Acyclic | No | Index | 3.093 |
| Algebraic Connectivity | 0.189 | Laplacian Largest Eigenvalue | 6.188 |
| Average Degree | 3.057 | Longest Induced Cycle | 34 |
| Bipartite | No | Longest Induced Path | 34 |
| Chromatic Index | 4 | Matching Number | 26 |
| Chromatic Number | 3 | Maximum Degree | 4 |
| Circumference | 52 | Minimum Degree | 3 |
| Claw-Free | No | Minimum Dominating Set | 15 |
| Clique Number | 2 | Number of Components | 1 |
| Connected | Yes | Number of Edges | 81 |
| Density | 0.059 | Number of Triangles | 0 |
| Diameter | 8 | Number of Vertices | 53 |
| Edge Connectivity | 3 | Planar | Yes |
| Eulerian | No | Radius | 6 |
| Genus | 0 | Regular | No |
| Girth | 5 | Second Largest Eigenvalue | 2.859 |
| Hamiltonian | No | Smallest Eigenvalue | -2.808 |
| Independence Number | 22 | 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 House of Graphs at May 12, 2022 1:50 PM.
A planar K2-hypohamiltonian graph. See "J. Goedgebeur, J. Renders, G. Wiener and C.T. Zamfirescu, K2-Hamiltonian Graphs: II, manuscript" for more details.
You need to be logged in to be able to add comments.