Adjacency matrix

Adjacency list

32269
Tree Automorphisms E8, N=10
Kevin Ryde
Invariant  Value  Invariant  Value 

Acyclic  Yes  Index  2.262 
Algebraic Connectivity  0.18  Laplacian Largest Eigenvalue  5.346 
Average Degree  1.8  Longest Induced Cycle  undefined 
Bipartite  Yes  Longest Induced Path  5 
Chromatic Index  4  Matching Number  3 
Chromatic Number  2  Maximum Degree  4 
Circumference  undefined  Minimum Degree  1 
ClawFree  No  Minimum Dominating Set  3 
Clique Number  2  Number of Components  1 
Connected  Yes  Number of Edges  9 
Density  0.2  Number of Triangles  0 
Diameter  5  Number of Vertices  10 
Edge Connectivity  1  Planar  Yes 
Eulerian  No  Radius  3 
Genus  0  Regular  No 
Girth  undefined  Second Largest Eigenvalue  1.657 
Hamiltonian  No  Smallest Eigenvalue  2.262 
Independence Number  7  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.