Hamiltonian graph
graph containing a Hamiltonian cycle
Paley graph
node-link graph of elements of a finite field, adjacent when their difference is a quadratic residue
crown graph
type of graph
Klein graph
two different but related regular graphs
Kummer graph
graph with 32 vertices and 96 edges
Sylvester graph
5-regular graph with 36 vertices and 90 edges
prism graph
graph with a prism as its skeleton
Gray graph
undirected bipartite graph with 54 vertices and 81 edges
Soifer Graph
planar graph with 9 vertices and 20 edges
Ljubljana graph
undirected bipartite graph with 112 vertices and 168 edges
Desargues graph
highly symmetric graph with 20 vertices and 30 edges
Fritsch graph
planar graph with 9 vertices and 21 edges
Golomb graph
undirected unit-distance graph requiring four colors
Franklin graph
graph often embedded on the Klein bottle
Foster graph
bipartite 3-regular graph with 90 vertices and 135 edges
Pappus graph
graph with 18 vertices and 27 edges, formed as the Levi graph of the Pappus configuration
Robertson graph
4-regular graph with 19 vertices and 38 edges
Wells graph
5-regular graph with 32 vertices and 80 edges
wheel graph
graph formed from a cycle graph by adding a new vertex adjacent to all the vertices in the cycle
hypercube graph
graphs formed by a hypercube's edges and vertices
Brinkmann graph
4-regular graph with 21 vertices and 42 edges
Folkman graph
graph with 20 vertices and 40 edges, the smallest semi-symmetric graph
Poussin graph
graph with 15 vertices and 39 edges
Wagner graph
cubic graph with 8 vertices and 12 edges
local McLaughlin graph
graph with 162 vertices and 4536 edges
truncated icosahedral graph
graph with 60 vertices and 90 edges
Platonic graph
graph with a Platonic solid as its skeleton
Holt graph
graph with 27 vertices and 54 edges, the smallest half-transitive graph
Nauru graph
node-link graph with 24 vertices, one of seven symmetric generalized Petersen graphs
McGee graph
graph with 24 vertices and 36 edges
Dyck graph
node-link graph, the only cubic symmetric graph on 32 vertices
Hoffman graph
4-regular graph with 16 vertices and 32 edges
Kittell graph
maximal planar graph on 23 nodes
second Royle graph
planar, Hamiltonian, and Eulerian graph with 8 vertices and 18 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
Archimedean graph
graph that forms the skeleton of one of the Archimedean solids
pancake graph
graph whose vertices are the permutations of n symbols from 1 to n and its edges are given between permutations transitive by prefix reversals
Gewirtz graph
strongly regular graph with 56 vertices and valency 10
Harries graph
3-regular undirected graph with 70 vertices and 105 edges
McLaughlin graph
strongly regular graph with 275 vertices and 15400 edges
diamond graph
graph with 4 vertices and 5 edges
truncated tetrahedral graph
graph with 12 vertices and 18 edges