Adjacency matrix

Adjacency list

35455
two 4cycles crossconnected at 2 opposing vertices
Kevin Ryde
Invariant  Value  Invariant  Value 

Acyclic  No  Index  2.562 
Algebraic Connectivity  0.764  Laplacian Largest Eigenvalue  5.236 
Average Degree  2.5  Longest Induced Cycle  6 
Bipartite  Yes  Longest Induced Path  4 
Chromatic Index  3  Matching Number  4 
Chromatic Number  2  Maximum Degree  3 
Circumference  6  Minimum Degree  2 
ClawFree  No  Minimum Dominating Set  2 
Clique Number  2  Number of Components  1 
Connected  Yes  Number of Edges  10 
Density  0.357  Number of Triangles  0 
Diameter  3  Number of Vertices  8 
Edge Connectivity  2  Planar  Yes 
Eulerian  No  Radius  3 
Genus  0  Regular  No 
Girth  4  Second Largest Eigenvalue  1.562 
Hamiltonian  No  Smallest Eigenvalue  2.562 
Independence Number  4  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.