Adjacency matrix

Adjacency list

33621
Dexter N=4
Kevin Ryde
Invariant  Value  Invariant  Value 

Acyclic  No  Index  3.316 
Algebraic Connectivity  0.625  Laplacian Largest Eigenvalue  7.117 
Average Degree  3  Longest Induced Cycle  9 
Bipartite  No  Longest Induced Path  9 
Chromatic Index  5  Matching Number  7 
Chromatic Number  3  Maximum Degree  5 
Circumference  13  Minimum Degree  2 
ClawFree  No  Minimum Dominating Set  4 
Clique Number  2  Number of Components  1 
Connected  Yes  Number of Edges  21 
Density  0.231  Number of Triangles  0 
Diameter  5  Number of Vertices  14 
Edge Connectivity  2  Planar  Yes 
Eulerian  No  Radius  3 
Genus  0  Regular  No 
Girth  4  Second Largest Eigenvalue  1.992 
Hamiltonian  No  Smallest Eigenvalue  3.288 
Independence Number  7  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.