Graph details
|
|
Adjacency matrix
|
Adjacency list
|
HoG graph id
49227
Graph name
n/a
Graph submitted by
Steven Van Overberghe
Invariant values
The definitions of the invariants can be found here.| Invariant | Value | Invariant | Value |
|---|---|---|---|
| Acyclic | No | Index | 5 |
| Algebraic Connectivity | 3 | Laplacian Largest Eigenvalue | 8 |
| Average Degree | 5 | Longest Induced Cycle | 6 |
| Bipartite | No | Longest Induced Path | 5 |
| Chromatic Index | 5 | Matching Number | 6 |
| Chromatic Number | 3 | Maximum Degree | 5 |
| Circumference | 12 | Minimum Degree | 5 |
| Claw-Free | No | Minimum Dominating Set | 3 |
| Clique Number | 3 | Number of Components | 1 |
| Connected | Yes | Number of Edges | 30 |
| Density | 0.455 | Number of Triangles | 12 |
| Diameter | 2 | Number of Vertices | 12 |
| Edge Connectivity | 5 | Planar | No |
| Eulerian | No | Radius | 2 |
| Genus | 1 | Regular | Yes |
| Girth | 3 | Second Largest Eigenvalue | 2 |
| Hamiltonian | Yes | Smallest Eigenvalue | -3 |
| Independence Number | 4 | Vertex Connectivity | 5 |
A table row rendered like this indicates that the graph is marked as being interesting for that invariant.
Comments
Posted by Steven Van Overberghe at Jun 6, 2022 11:20 AM.
One of two smallest (order, then size) vertex-transitive graphs with the minimal amount of automorphisms (that is: equal to the order) [excluding trivial graphs of order less than 3].
You need to be logged in to be able to add comments.