Adjacency matrix

Adjacency list

33607
Binary Tree Rotate AEmpty N=4
Kevin Ryde
Invariant  Value  Invariant  Value 

Acyclic  No  Index  2.492 
Algebraic Connectivity  0.107  Laplacian Largest Eigenvalue  5.254 
Average Degree  2.143  Longest Induced Cycle  4 
Bipartite  Yes  Longest Induced Path  9 
Chromatic Index  3  Matching Number  7 
Chromatic Number  2  Maximum Degree  3 
Circumference  4  Minimum Degree  1 
ClawFree  No  Minimum Dominating Set  5 
Clique Number  2  Number of Components  1 
Connected  Yes  Number of Edges  15 
Density  0.165  Number of Triangles  0 
Diameter  9  Number of Vertices  14 
Edge Connectivity  1  Planar  Yes 
Eulerian  No  Radius  5 
Genus  0  Regular  No 
Girth  4  Second Largest Eigenvalue  2.107 
Hamiltonian  No  Smallest Eigenvalue  2.492 
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.