Complete graph
Template:Short description Template:Infobox graph 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).<ref>Template:Citation; see p. 17</ref>
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.<ref>Template:Citation. </ref> Such a drawing is sometimes referred to as a mystic rose.<ref>Template:Citation.</ref>
PropertiesEdit
The complete graph on Template:Mvar vertices is denoted by Template:Mvar. Some sources claim that the letter Template:Mvar in this notation stands for the German word {{#invoke:Lang|lang}},<ref>Template:Citation.</ref> but the German name for a complete graph, {{#invoke:Lang|lang}}, does not contain the letter Template:Mvar, and other sources state that the notation honors the contributions of Kazimierz Kuratowski to graph theory.<ref>Template:Citation.</ref>
Template:Mvar has Template:Math edges (a triangular number), and is a regular graph of degree Template:Math. 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.
Template:Mvar can be decomposed into Template:Mvar trees Template:Mvar such that Template:Mvar has Template:Mvar vertices.<ref>Template:Cite journal</ref> Ringel's conjecture asks if the complete graph Template:Math can be decomposed into copies of any tree with Template:Mvar edges.<ref>Template:Cite conference</ref> This is known to be true for sufficiently large Template:Mvar.<ref>Template:Cite journal</ref><ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref>
The number of all distinct paths between a specific pair of vertices in Template:Math is given<ref>Hassani, M. "Cycles in graphs and derangements." Math. Gaz. 88, 123–126, 2004.</ref> by
- <math> w_{n+2} = n! e_n = \lfloor en!\rfloor,</math>
where Template:Mvar refers to Euler's constant, and
- <math>e_n = \sum_{k=0}^n\frac{1}{k!}.</math>
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 Template:Mvar-vertex graph.<ref>Template:Citation.</ref> The number of perfect matchings of the complete graph Template:Mvar (with Template:Mvar even) is given by the double factorial Template:Math.<ref>Template:Citation.</ref>
The crossing numbers up to Template:Math are known, with Template:Math requiring either 7233 or 7234 crossings. Further values are collected by the Rectilinear Crossing Number project.<ref>{{#invoke:citation/CS1|citation |CitationClass=web }}</ref> Rectilinear Crossing numbers for Template:Mvar 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 topologyEdit
A complete graph with Template:Mvar nodes represents the edges of an Template:Math-simplex. Geometrically Template:Math forms the edge set of a triangle, Template:Math a tetrahedron, etc. The Császár polyhedron, a nonconvex polyhedron with the topology of a torus, has the complete graph Template:Math as its skeleton.<ref>Template:Citation</ref> Every neighborly polytope in four or more dimensions also has a complete skeleton.
Template:Math through Template:Math 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 Template:Math 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 Template:Math nor the complete bipartite graph Template:Math 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, Template:Math plays a similar role as one of the forbidden minors for linkless embedding.<ref>Template:Citation.</ref> In other words, and as Conway and Gordon<ref>Template:Cite journal</ref> proved, every embedding of Template:Math 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 Template:Math contains a Hamiltonian cycle that is embedded in space as a nontrivial knot.
ExamplesEdit
Complete graphs on <math>n</math> vertices, for <math>n</math> between 1 and 12, are shown below along with the numbers of edges:
See alsoEdit
- Fully connected network, in computer networking
- Complete bipartite graph (or biclique), a special bipartite graph where every vertex on one side of the bipartition is connected to every vertex on the other side
- The simplex, which is identical to a complete graph of <math>n+1</math> vertices, where <math>n</math> is the dimension of the simplex.
ReferencesEdit
External linksEdit
Template:Sister project Template:Sister project
- {{#invoke:Template wrapper|{{#if:|list|wrap}}|_template=cite web
|_exclude=urlname, _debug, id |url = https://mathworld.wolfram.com/{{#if:CompleteGraph%7CCompleteGraph.html}} |title = Complete Graph |author = Weisstein, Eric W. |website = MathWorld |access-date = |ref = Template:SfnRef }}