|
Adjacency matrix[Too large to display] |
Adjacency list[Too large to display] |
33545
Binomial Tree Order 7
Kevin Ryde
Invariant | Value | Invariant | Value |
---|---|---|---|
Acyclic | Yes | Index | 3.453 |
Algebraic Connectivity | 0.014 | Laplacian Largest Eigenvalue | 9.314 |
Average Degree | 1.984 | Longest Induced Cycle | undefined |
Bipartite | Yes | Longest Induced Path | 13 |
Chromatic Index | 7 | Matching Number | 64 |
Chromatic Number | Computation time out | Maximum Degree | 7 |
Circumference | undefined | Minimum Degree | 1 |
Claw-Free | No | Minimum Dominating Set | 64 |
Clique Number | 2 | Number of Components | 1 |
Connected | Yes | Number of Edges | 127 |
Density | 0.016 | Number of Triangles | 0 |
Diameter | 13 | Number of Vertices | 128 |
Edge Connectivity | 1 | Planar | Yes |
Eulerian | No | Radius | 7 |
Genus | 0 | Regular | No |
Girth | undefined | Second Largest Eigenvalue | 3.02 |
Hamiltonian | No | Smallest Eigenvalue | -3.453 |
Independence Number | Computation time out | Vertex Connectivity | 1 |
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.