Adjacency matrix

Adjacency list

32232
Deleted Edge Symmetric, from No Add Edge, N=9
Kevin Ryde
Invariant  Value  Invariant  Value 

Acyclic  No  Index  4.162 
Algebraic Connectivity  2.209  Laplacian Largest Eigenvalue  6.791 
Average Degree  4  Longest Induced Cycle  6 
Bipartite  No  Longest Induced Path  4 
Chromatic Index  5  Matching Number  4 
Chromatic Number  3  Maximum Degree  5 
Circumference  9  Minimum Degree  3 
ClawFree  No  Minimum Dominating Set  3 
Clique Number  3  Number of Components  1 
Connected  Yes  Number of Edges  18 
Density  0.5  Number of Triangles  7 
Diameter  2  Number of Vertices  9 
Edge Connectivity  3  Planar  No 
Eulerian  No  Radius  2 
Genus  1  Regular  No 
Girth  3  Second Largest Eigenvalue  1.303 
Hamiltonian  Yes  Smallest Eigenvalue  2.303 
Independence Number  3  Vertex Connectivity  3 
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.