Adjacency matrix

Adjacency list

33553
Seidel Cospectral Tree N=12
Kevin Ryde
Invariant  Value  Invariant  Value 

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