Adjacency matrix

Adjacency list

30
Fork Graph
GraPHedron
Invariant  Value  Invariant  Value 

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