Complete graph

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]