Individual graphs

thumb|A tetrahedron.

In geometry, an icosahedron ( or ) is a polyhedron with 20 faces. The name comes . The plural can be either "icosahedra" () or "icosahedrons".

Archimedean solid

Archimedean solid

cubic graph with 10 vertices and 15 edges

Platonic solid

Archimedean solid

thumb|right|Net (polyhedron)|Net In geometry, the 120-cell is the convex regular 4-polytope (four-dimensional analogue of a Platonic solid) with Schläfli symbol {5,3,3}. It is also called a C120, dodecaplex (short for "dodecahedral complex"), hyperdodecahedron, polydodecahedron, hecatonicosachoron, dodecacontachoron and hecatonicosahedroid.

undirected graph with 14 vertices, 21 edges, and girth 6

node-link graph with 50 vertices and 175 edges, the smallest possible 7-regular graph of girth 5

highly symmetric graph with 20 vertices and 30 edges

a triangle-free 4-regular 4-chromatic graph with 12 vertices and 24 edges

graph with 20 vertices and 40 edges, the smallest semi-symmetric graph

cubic graph with 12 vertices and 18 edges

graph with 5 nodes and 6 edges

undirected bipartite graph with 112 vertices and 168 edges

graph with 24 vertices and 36 edges

cubic distance-regular graph with 28 vertices and 42 edges

one of two different regular graphs with 16 vertices

asymmetric cubic planar graph with 12 vertices and 18 edges

highly-symmetric node-link graph with 100 vertices and 22 edges per vertex

graph with 4 vertices and 5 edges

bipartite undirected graph

node-link graph, the only cubic symmetric graph on 32 vertices

one of three 12-regular graphs with 28 vertices and 168 edges

complete graph on 3 vertices

node-link graph with 24 vertices, one of seven symmetric generalized Petersen graphs

graph with 18 vertices and 27 edges, formed as the Levi graph of the Pappus configuration

undirected bipartite graph with 54 vertices and 81 edges

graph with 50 vertices and 75 edges

infinite graph containing all countable graphs

cubic graph with 12 vertices and 18 edges

cubic graph with 102 vertices and 153 edges

bipartite 3-regular graph with 90 vertices and 135 edges

20-regular undirected graph with 81 vertices and 810 edges

cubic graph with 46 vertices and 69 edges

strongly regular graph with 16 vertices and 48 edges

simple undirected graph with 11 vertices and 27 edges

graph with 27 vertices and 54 edges, the smallest half-transitive graph

graph with 30 vertices and 45 edges

triangle-free graph requiring four colors

highly symmetric cubic graph with 30 vertices and 45 edges

strongly regular Cayley graph with 77 vertices and 616 edges

16-regular graph with 27 vertices and 216 edges

snark with 50 vertices and 75 edges

cubic graph with 70 vertices and 105 edges

cubic graph with 112 vertices and 168 edges

graph with 96 vertices and 144 edges, the first known non-Hamiltonian cubic 3-connected bipartite graph

undirected unit-distance graph requiring four colors

cubic graph with 8 vertices and 12 edges

undirected cubic graph with 12 vertices and 18 edges

graph that represents all legal moves of the knight on a chessboard

highly-symmetric node-link graph with 100 vertices and 36 edges per vertex

cubic graph with 126 vertices and 189 edges

graph with 5 vertices and 5 edges

symmetric bipartite cubic graph with 26 vertices and 39 edges

4-regular graph with 16 vertices and 32 edges

strongly regular graph with 56 vertices and valency 10

symmetric bipartite cubic graph with 16 vertices and 24 edges