strongly regular graph
graph in which the number of shared neighbors of two vertices depends only on whether they are adjacent
Paley graph
node-link graph of elements of a finite field, adjacent when their difference is a quadratic residue
octahedral graph
polyhedral graph of the octahedron, with 6 vertices and 12 edges
Cameron graph
strongly regular graph with 231 vertices and 3465 edges
edgeless graph
graph without edges (on any number of vertices)
conference graph
special case of a strongly regular graph
local McLaughlin graph
graph with 162 vertices and 4536 edges
odd graph
family of symmetric graphs which generalize the Petersen graph
Games graph
largest known locally linear strongly regular graph
Petersen graph
cubic graph with 10 vertices and 15 edges
Suzuki graph
strongly regular graph with 1782 vertices and 370656 edges
complete graph
simple undirected graph in which every pair of distinct vertices is connected by a unique edge
Gewirtz graph
strongly regular graph with 56 vertices and valency 10
McLaughlin graph
strongly regular graph with 275 vertices and 15400 edges