Strongly regular graphs

The strongly regular graph on v vertices and rank k is usually denoted srg(v,k,λ,μ).

Symmetric graphs

A symmetric graph is one in which there is a symmetry (graph automorphism) taking any ordered pair of adjacent vertices to any other ordered pair; the Foster census lists all small symmetric 3-regular graphs. Every strongly regular graph is symmetric, but not vice versa.

Semi-symmetric graphs

Complete graphs

The complete graph on ${\displaystyle n}$ vertices is often called the ${\displaystyle n}$-clique and usually denoted ${\displaystyle K_{n}}$, from German komplett.^[2]

Complete bipartite graphs

The complete bipartite graph is usually denoted ${\displaystyle K_{n,m}}$. The graph ${\displaystyle K_{2,2}}$ equals the 4-cycle ${\displaystyle C_{4}}$ (the square) introduced below.

Cycles

The cycle graph on ${\displaystyle n}$ vertices is called the n-cycle and usually denoted ${\displaystyle C_{n}}$. It is also called a cyclic graph, a polygon or the n-gon. Special cases are the triangle ${\displaystyle C_{3}}$, the square ${\displaystyle C_{4}}$, and then several with Greek naming pentagon ${\displaystyle C_{5}}$, hexagon ${\displaystyle C_{6}}$, etc.

Friendship graphs

The friendship graph F_n can be constructed by joining n copies of the cycle graph C₃ with a common vertex.^[3]

Fullerene graphs

In graph theory, the term fullerene refers to any 3-regular, planar graph with all faces of size 5 or 6 (including the external face). It follows from Euler's polyhedron formula, ${\displaystyle V-E+F=2}$ (where ${\displaystyle V,E,F}$ indicate the number of vertices, edges, and faces), that there are exactly 12 pentagons in a fullerene and ${\displaystyle V/2-10}$ hexagons. Fullerene graphs are the Schlegel representations of the corresponding fullerene compounds.

Platonic solids

The complete graph on four vertices forms the skeleton of the tetrahedron, and more generally the complete graphs form skeletons of simplices. The hypercube graphs are also skeletons of higher dimensional regular polytopes.

Truncated Platonic solids

Snarks

A snark is a bridgeless cubic graph that requires four colors in any edge coloring. The smallest snark is the Petersen graph, already listed above.

Star

A star S_k is the complete bipartite graph K_1,k. The star S₃ is called the claw graph.

Wheel

The wheel graph W_n is a graph on n vertices constructed by connecting a single vertex to every vertex in an (n-1)-cycle.