connected graph
graph having only one connected component
k-vertex-connected graph
graph with more than k vertices that cannot be disconnected by the deletion of fewer than k vertices
Cameron graph
strongly regular graph with 231 vertices and 3465 edges
connected component of a graph
maximal subgraph of a given node-link graph within which every two vertices may be connected by a path
snark
connected, bridgeless cubic graph with chromatic index equal to 4
cage
regular graph that has as few vertices as possible for its girth
critical graph
undirected graph
k-edge-connected graph
graph that remains connected whenever fewer than k edges are removed
Hall Graph
10-regular graph with 65 vertices and 325 edges
Walther graph
planar graph with 25 vertices and 31 edges
Laman graph
graphs describing the minimally rigid systems of rods and joints in the plane
tree
undirected, connected and acyclic graph
Suzuki graph
strongly regular graph with 1782 vertices and 370656 edges
moth graph
graph with 6 vertices and 7 edges
ladder graph
planar undirected graph with 2n vertices and 3n-2 edges; the Cartesian product of two path graphs, one of which has only one edge
windmill graph
undirected graph constucted by joining multiple complete graphs at a shared universal vertex
zero-symmetric graph
connected graph in which each vertex has exactly three incident edges and, for each two vertices, there is a unique symmetry taking one vertex to the other
Laves graph
periodic spatial graph
geodetic graph
graph whose shortest paths are unique
complete graph
simple undirected graph in which every pair of distinct vertices is connected by a unique edge
cactus graph
connected graph in which any two simple cycles have at most one vertex in common
Livingstone graph
graph with 266 vertices and 1463 edges
cop-win graph
type of graph related to pursuit-evasion