Graph details
|
|
Adjacency matrix[Too large to display] |
Adjacency list[Too large to display] |
HoG graph id
44091
Graph name
Möbius Tesseract Filled Avatar Graph
Graph submitted by
Sven Nilsen
Invariant values
The definitions of the invariants can be found here.| Invariant | Value | Invariant | Value |
|---|---|---|---|
| Acyclic | No | Index | 4 |
| Algebraic Connectivity | 2 | Laplacian Largest Eigenvalue | 7.236 |
| Average Degree | 4 | Longest Induced Cycle | 8 |
| Bipartite | No | Longest Induced Path | 7 |
| Chromatic Index | 4 | Matching Number | 8 |
| Chromatic Number | 3 | Maximum Degree | 4 |
| Circumference | 16 | Minimum Degree | 4 |
| Claw-Free | No | Minimum Dominating Set | 4 |
| Clique Number | 2 | Number of Components | 1 |
| Connected | Yes | Number of Edges | 32 |
| Density | 0.267 | Number of Triangles | 0 |
| Diameter | 3 | Number of Vertices | 16 |
| Edge Connectivity | 4 | Planar | No |
| Eulerian | Yes | Radius | 3 |
| Genus | 2 | Regular | Yes |
| Girth | 4 | Second Largest Eigenvalue | 2 |
| Hamiltonian | Yes | Smallest Eigenvalue | -3.236 |
| Independence Number | 6 | Vertex Connectivity | 4 |
A table row rendered like this indicates that the graph is marked as being interesting for that invariant.
Comments
Posted by Sven Nilsen at Feb 7, 2021 2:56 PM.
A filled Avatar Graph discovered by finding a Möbius tesseract solution to the Constructive Symmetry Breaking problem, see https://github.com/advancedresearch/avatar_graph/issues/56
You need to be logged in to be able to add comments.