|
Adjacency matrix
|
Adjacency list
|
44103
Harry Potter Scar Filled Avatar Graph
Sven Nilsen
Invariant | Value | Invariant | Value |
---|---|---|---|
Acyclic | No | Index | 3.414 |
Algebraic Connectivity | 1.466 | Laplacian Largest Eigenvalue | 7.051 |
Average Degree | 3.25 | Longest Induced Cycle | 4 |
Bipartite | Yes | Longest Induced Path | 3 |
Chromatic Index | 4 | Matching Number | 4 |
Chromatic Number | 2 | Maximum Degree | 4 |
Circumference | 8 | Minimum Degree | 2 |
Claw-Free | No | Minimum Dominating Set | 2 |
Clique Number | 2 | Number of Components | 1 |
Connected | Yes | Number of Edges | 13 |
Density | 0.464 | Number of Triangles | 0 |
Diameter | 3 | Number of Vertices | 8 |
Edge Connectivity | 2 | Planar | No |
Eulerian | No | Radius | 2 |
Genus | 1 | Regular | No |
Girth | 4 | Second Largest Eigenvalue | 1 |
Hamiltonian | Yes | Smallest Eigenvalue | -3.414 |
Independence Number | 4 | Vertex Connectivity | 2 |
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.