Gallery of named graphs
From Wikipedia, the free encyclopedia
Some of the finite structures considered in graph theory have names, sometimes inspired by the graph's topology, and sometimes after their discoverer. A famous example is the Petersen graph, a concrete graph on 10 vertices that appears as a minimal example or counterexample in many different contexts.
Contents |
[edit] Individual graphs
 Triangle, K3, C3 |
 Square, C4 |
 Claw, K1,3, S4 |
 Pentagon |
 Thomsen graph, Utility graph, K3,3 |
 Cube |
 Octahedron |
 Brinkman graph |
 Clebsch graph |
Dodecahedron |
 Flower snark |
|
|
Thomassen graph |
[edit] Graph families
[edit] Complete graphs
The complete graph on n vertices is often called the n-clique and usually denoted Kn, from German komplett.[citation needed]
 K1 |
 K2 |
K3 |
 K4 |
 K5 |
 K6 |
 K7 |
 K8 |
[edit] Complete bipartite graphs
The complete bipartite graph is usually denoted Kn,m
 K3,1 |
 K3,2 |
K3,3 |
[edit] Cycles
The cycle graph on n vertices is called the n-cycle and usually denoted Cn. It is also called a cyclic graph, a polygon or the n-gon. Special cases are the triangle C3, the square C4, and the pentagon C5.
|
C3 |
C4 |
C5 |
 C6 |
[edit] Star
 S7 |
[edit] Wheel
The wheel graph Wn is a graph on n vertices constructed by connecting a single vertex to every vertex in an (n-1)-cycle.
 Wheels W4 – W9 |
