Adjacency matrix

Adjacency list

32274
LexMax Vpar Forests Differences N=4
Kevin Ryde
Invariant  Value  Invariant  Value 

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