undirected graph
graph for which the relations between pairs of vertices are symmetric
Foster cage
5-regular graph with 30 vertices and 75 edges
Paley graph
node-link graph of elements of a finite field, adjacent when their difference is a quadratic residue
crown graph
type of graph
Gray graph
undirected bipartite graph with 54 vertices and 81 edges
Soifer Graph
planar graph with 9 vertices and 20 edges
semi-symmetric graph
graph that is edge-transitive and regular but not vertex-transitive
well-covered graph
graph with equal-size maximal independent sets
connected graph
graph having only one connected component
spanning tree
subgraph of an undirected graph G that is a tree which includes all of the vertices of G
critical graph
undirected graph
Ljubljana graph
undirected bipartite graph with 112 vertices and 168 edges
Desargues graph
highly symmetric graph with 20 vertices and 30 edges
intersection graph
non-oriented graph in which two nodes are linked if and only if the two parts of a common space and represented by these nodes have a non-empty intersection in that space
block graph
graph whose biconnected components are all cliques
king's graph
graph that represents all legal moves of the king on a chessboard
Rado graph
infinite graph containing all countable graphs
random geometric graph
in graph theory, the mathematically simplest spatial network
Pappus graph
graph with 18 vertices and 27 edges, formed as the Levi graph of the Pappus configuration
Johnson graph
class of undirected graphs defined from systems of sets
well-colored graph
undirected graph whose Grundy number equals its chromatic number
wheel graph
graph formed from a cycle graph by adding a new vertex adjacent to all the vertices in the cycle
unit disk graph
intersection graph of unit disks in the plane
clique graph
graph representing structure of another graph's cliques
Hanoi graph
graph representing the possible states of the Tower of Hanoi puzzle
free tree
connected, acyclic, undirected graph without a designated root node
Meredith graph
4-regular undirected graph with 70 vertices and 140 edges
comparability graph
undirected graph linking pairs of comparable elements in a partial order
unit distance graph
node-link graph of points in the plane, adjacent when their distance is exactly one
Petersen graph
cubic graph with 10 vertices and 15 edges
McGee graph
graph with 24 vertices and 36 edges
butterfly graph
graph with 5 nodes and 6 edges
Hoffman graph
4-regular graph with 16 vertices and 32 edges
lattice graph
graph that can be drawn within a repeating arrangement of points
Henson graph
type of infinite graph
bishop's graph
graph that represents all legal moves of the bishop on a chessboard
queen's graph
graph that represents all legal moves of the queen on a chessboard
complete graph
simple undirected graph in which every pair of distinct vertices is connected by a unique edge
circulant graph
undirected graph acted on by a vertex-transitive cyclic group of symmetries
cop-win graph
type of graph related to pursuit-evasion