Linked from

The 31 pages that link to Complete graph, each with the reason it gives.

• Simple graphBroader topic: It is the maximally connected simple graph on a fixed number of vertices.

• Line graphBroader topic: The line graph of a complete graph displays dense edge-incidence structure.

• Connected graphBroader topic: Every complete graph is connected, with each pair linked directly.

• TreewidthBroader topic: A complete graph on n vertices has treewidth n minus one.

• Undirected graphBroader topic: It is the densest simple undirected graph on a fixed number of vertices.

• Vertex-transitive graphBroader topic: Every permutation of its vertices is an automorphism.

• Chromatic polynomialBroader topic: Its polynomial is the falling factorial, a direct formula illustrating the count.

• Regular graphBroader topic: Every complete graph is regular, with degree one less than its number of vertices.

• Vizing's theoremBroader topic: Complete graphs provide familiar examples whose edge chromatic number can be computed exactly.

• Metcalfe's lawBroader topic: A fully connected network with n users has n(n−1)/2 possible pairwise links.

• Bunkbed conjectureBroader topic: Its dense symmetry makes it a natural base graph for explicit probability calculations.

• Lovász conjectureBroader topic: Every complete graph with at least two vertices has a Hamiltonian path.