|
Adjacency matrix |
Adjacency list |
44093
Null
Sven Nilsen
Invariant | Value | Invariant | Value |
---|---|---|---|
Acyclic | Yes | Index | undefined |
Algebraic Connectivity | Computation time out | Laplacian Largest Eigenvalue | Computation time out |
Average Degree | undefined | Longest Induced Cycle | undefined |
Bipartite | Yes | Longest Induced Path | 0 |
Chromatic Index | undefined | Matching Number | 0 |
Chromatic Number | undefined | Maximum Degree | 0 |
Circumference | undefined | Minimum Degree | 0 |
Claw-Free | Yes | Minimum Dominating Set | undefined |
Clique Number | 0 | Number of Components | 0 |
Connected | Yes | Number of Edges | 0 |
Density | undefined | Number of Triangles | 0 |
Diameter | undefined | Number of Vertices | 0 |
Edge Connectivity | 0 | Planar | Yes |
Eulerian | Yes | Radius | undefined |
Genus | Computation time out | Regular | Yes |
Girth | undefined | Second Largest Eigenvalue | undefined |
Hamiltonian | No | Smallest Eigenvalue | undefined |
Independence Number | 0 | Vertex Connectivity | 0 |
A table row rendered like this indicates that the graph is marked as being interesting for that invariant.
You need to be logged in to be able to add comments.