Complete graph
K7, a complete graph with 7 vertices
Vertices	n
Edges	${\displaystyle \textstyle {\frac {n(n-1)}{2))}$
Radius	${\displaystyle \left\((\begin{array}{ll}0&n\leq 1\\1&{\text{otherwise))\end{array))\right.}$
Diameter	${\displaystyle \left\((\begin{array}{ll}0&n\leq 1\\1&{\text{otherwise))\end{array))\right.}$
Girth	${\displaystyle \left\((\begin{array}{ll}\infty &n\leq 2\\3&{\text{otherwise))\end{array))\right.}$
Automorphisms	n! (Sn)
Chromatic number	n
Chromatic index	n if n is odd n − 1 if n is even
Spectrum	${\displaystyle \left\((\begin{array}{lll}\emptyset &n=0\\\left\{0^{1}\right\}&n=1\\\left\{(n-1)^{1},-1^{n-1}\right\}&{\text{otherwise))\end{array))\right.}$
Properties	(n − 1)-regular Symmetric graph Vertex-transitive Edge-transitive Strongly regular Integral
Notation	Kn
Table of graphs and parameters

In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge. A complete digraph is a directed graph in which every pair of distinct vertices is connected by a pair of unique edges (one in each direction).^[1]

Graph theory itself is typically dated as beginning with Leonhard Euler's 1736 work on the Seven Bridges of Königsberg. However, drawings of complete graphs, with their vertices placed on the points of a regular polygon, had already appeared in the 13th century, in the work of Ramon Llull.^[2] Such a drawing is sometimes referred to as a mystic rose.^[3]

Properties

The complete graph on n vertices is denoted by K_n. Some sources claim that the letter K in this notation stands for the German word komplett,^[4] but the German name for a complete graph, vollständiger Graph, does not contain the letter K, and other sources state that the notation honors the contributions of Kazimierz Kuratowski to graph theory.^[5]

K_n has n(n – 1)/2 edges (a triangular number), and is a regular graph of degree n – 1. All complete graphs are their own maximal cliques. They are maximally connected as the only vertex cut which disconnects the graph is the complete set of vertices. The complement graph of a complete graph is an empty graph.

If the edges of a complete graph are each given an orientation, the resulting directed graph is called a tournament.

K_n can be decomposed into n trees T_i such that T_i has i vertices.^[6] Ringel's conjecture asks if the complete graph K_2n+1 can be decomposed into copies of any tree with n edges.^[7] This is known to be true for sufficiently large n.^[8][9]

The number of all distinct paths between a specific pair of vertices in K_n+2 is given^[10] by

${\displaystyle w_{n+2}=n!e_{n}=\lfloor en!\rfloor ,}$

where e refers to Euler's constant, and

${\displaystyle e_{n}=\sum _{k=0}^{n}{\frac {1}{k!)).}$

The number of matchings of the complete graphs are given by the telephone numbers

1, 1, 2, 4, 10, 26, 76, 232, 764, 2620, 9496, 35696, 140152, 568504, 2390480, 10349536, 46206736, ... (sequence A000085 in the OEIS).

These numbers give the largest possible value of the Hosoya index for an n-vertex graph.^[11] The number of perfect matchings of the complete graph K_n (with n even) is given by the double factorial (n – 1)!!.^[12]

The crossing numbers up to K₂₇ are known, with K₂₈ requiring either 7233 or 7234 crossings. Further values are collected by the Rectilinear Crossing Number project.^[13] Rectilinear Crossing numbers for K_n are

0, 0, 0, 0, 1, 3, 9, 19, 36, 62, 102, 153, 229, 324, 447, 603, 798, 1029, 1318, 1657, 2055, 2528, 3077, 3699, 4430, 5250, 6180, ... (sequence A014540 in the OEIS).

Geometry and topology

A complete graph with n nodes represents the edges of an (n – 1)-simplex. Geometrically K₃ forms the edge set of a triangle, K₄ a tetrahedron, etc. The Császár polyhedron, a nonconvex polyhedron with the topology of a torus, has the complete graph K₇ as its skeleton.^[15] Every neighborly polytope in four or more dimensions also has a complete skeleton.

K₁ through K₄ are all planar graphs. However, every planar drawing of a complete graph with five or more vertices must contain a crossing, and the nonplanar complete graph K₅ plays a key role in the characterizations of planar graphs: by Kuratowski's theorem, a graph is planar if and only if it contains neither K₅ nor the complete bipartite graph K_3,3 as a subdivision, and by Wagner's theorem the same result holds for graph minors in place of subdivisions. As part of the Petersen family, K₆ plays a similar role as one of the forbidden minors for linkless embedding.^[16] In other words, and as Conway and Gordon^[17] proved, every embedding of K₆ into three-dimensional space is intrinsically linked, with at least one pair of linked triangles. Conway and Gordon also showed that any three-dimensional embedding of K₇ contains a Hamiltonian cycle that is embedded in space as a nontrivial knot.

Examples

Complete graphs on ${\displaystyle n}$ vertices, for ${\displaystyle n}$ between 1 and 12, are shown below along with the numbers of edges:

K1: 0	K2: 1	K3: 3	K4: 6
K5: 10	K6: 15	K7: 21	K8: 28
K9: 36	K10: 45	K11: 55	K12: 66