Eulerian graph
graph containing an Eulerian cycle
Brinkmann graph
4-regular graph with 21 vertices and 42 edges
local McLaughlin graph
graph with 162 vertices and 4536 edges
friendship graph
planar undirected graph with 2n+1 vertices and 3n edges
Meredith graph
4-regular undirected graph with 70 vertices and 140 edges
cycle graph
graph that consists of a single cycle
Hoffman graph
4-regular graph with 16 vertices and 32 edges
second Royle graph
planar, Hamiltonian, and Eulerian graph with 8 vertices and 18 edges