integral graph
node-link graph for which all eigenvalues of its characteristic polynomial are integers
Kummer graph
graph with 32 vertices and 96 edges
Sylvester graph
5-regular graph with 36 vertices and 90 edges
octahedral graph
polyhedral graph of the octahedron, with 6 vertices and 12 edges
edgeless graph
graph without edges (on any number of vertices)
triangle graph
complete graph on 3 vertices
Desargues graph
highly symmetric graph with 20 vertices and 30 edges
house graph
graph with 5 vertices and 6 edges
tetrahedral graph
complete graph on 4 vertices
hypercube graph
graphs formed by a hypercube's edges and vertices
local McLaughlin graph
graph with 162 vertices and 4536 edges
Moser spindle
undirected unit-distance graph requiring four colors
Nauru graph
node-link graph with 24 vertices, one of seven symmetric generalized Petersen graphs
utility graph
complete bipartite graph with 3 vertices in each independent set
Petersen graph
cubic graph with 10 vertices and 15 edges
Hoffman graph
4-regular graph with 16 vertices and 32 edges
Suzuki graph
strongly regular graph with 1782 vertices and 370656 edges
rook's graph
graph that represents all legal moves of the rook chess piece on a chessboard
complete graph
simple undirected graph in which every pair of distinct vertices is connected by a unique edge
McLaughlin graph
strongly regular graph with 275 vertices and 15400 edges
icosahedral graph
polyhedral graph of the icosahedron, with 12 vertices and 30 edges
truncated tetrahedral graph
graph with 12 vertices and 18 edges