Adjacency matrix

Adjacency list

6607
Paley graph on 9 vertices
Frédéric Vanhove
Invariant  Value  Invariant  Value 

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