Adjacency matrix

Adjacency list

49237
Faren's graph
Henry Simmons
Invariant  Value  Invariant  Value 

Acyclic  No  Index  3.96 
Algebraic Connectivity  0.963  Laplacian Largest Eigenvalue  6.787 
Average Degree  3.778  Longest Induced Cycle  4 
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  2 
Clique Number  3  Number of Components  1 
Connected  Yes  Number of Edges  17 
Density  0.472  Number of Triangles  8 
Diameter  3  Number of Vertices  9 
Edge Connectivity  3  Planar  Yes 
Eulerian  No  Radius  2 
Genus  0  Regular  No 
Girth  3  Second Largest Eigenvalue  2.347 
Hamiltonian  Yes  Smallest Eigenvalue  2.566 
Independence Number  3  Vertex Connectivity  2 
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.