Adjacency matrix

Adjacency list

32267
Forest Automorphisms E8, N=8
Kevin Ryde
Invariant  Value  Invariant  Value 

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