Graph details
|
|
Adjacency matrix
|
Adjacency list
|
HoG graph id
45595
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 |
| Algebraic Connectivity | 1.438 | Laplacian Largest Eigenvalue | 5.562 |
| Average Degree | 3 | Longest Induced Cycle | 5 |
| Bipartite | No | Longest Induced Path | 4 |
| Chromatic Index | 3 | Matching Number | 4 |
| Chromatic Number | 3 | Maximum Degree | 3 |
| Circumference | 8 | Minimum Degree | 3 |
| Claw-Free | No | Minimum Dominating Set | 3 |
| Clique Number | 3 | Number of Components | 1 |
| Connected | Yes | Number of Edges | 12 |
| Density | 0.429 | Number of Triangles | 1 |
| Diameter | 2 | Number of Vertices | 8 |
| Edge Connectivity | 3 | Planar | No |
| Eulerian | No | Radius | 2 |
| Genus | 1 | Regular | Yes |
| Girth | 3 | Second Largest Eigenvalue | 1.562 |
| Hamiltonian | Yes | Smallest Eigenvalue | -2.562 |
| Independence Number | 3 | Vertex Connectivity | 3 |
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 Mar 30, 2021 9:08 PM.
A cubic graph with the maximum number of edge-Kempe equivalence classes for the given order. See: "J. Goedgebeur and P.R.J. Ostergard, Switching 3-edge-colorings of cubic graphs, manuscript, 2021" for more details.
You need to be logged in to be able to add comments.