komplett graf

Also known as complete digraph, complete graphs, complete digraphs, 2K1-free graph

simple undirected graph in which every pair of distinct vertices is connected by a unique edge

In the Vinony graph

Within Vinony's link graph, komplett graf is referenced by 516 other articles, and connects out to graph, Császár polyhedron and mathematics.

It sits within the topics Parametric families of graphs and Regular graphs.

Its subject is documented across 38 Wikipedia language editions.

Key facts

Vertices: n
Edges: n ( n − 1 ) 2 {\displaystyle \textstyle {\frac {n(n-1)}{2}}}
Radius: { 0 n ≤ 1 1 otherwise {\displaystyle \left\{{\begin{array}{ll}0&n\leq 1\\1&{\text{otherwise}}\end{array}}\right.}
Diameter: { 0 n ≤ 1 1 otherwise {\displaystyle \left\{{\begin{array}{ll}0&n\leq 1\\1&{\text{otherwise}}\end{array}}\right.}
Girth: { ∞ n ≤ 2 3 otherwise {\displaystyle \left\{{\begin{array}{ll}\infty &n\leq 2\\3&{\text{otherwise}}\end{array}}\right.}
Automorphisms: n ! ( S n )
Chromatic number: n
Chromatic index: n if n is odd n − 1 if n is even
Spectrum: { ∅ n = 0 { 0 1 } n = 1 { ( n − 1 ) 1 , − 1 n − 1 } otherwise {\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: K n

via Wikipedia infobox

Wikidata facts

Subclass of: Moore graph
Image: Complete graph example.svg

Show 6 more facts

maintained by WikiProject: WikiProject Mathematics
Commons category: Complete graphs
graph diameter: 1
graph radius: 1
studied by: graph theory
opposite of: edgeless graph

Sources (2)

via Wikidata · CC0

Article · Svenska

En komplett graf är i det matematiska området grafteori en enkel graf där varje par av distinkta noder har en båge mellan sig. En komplett graf med noder betecknas .

Abstract from DBpedia / Wikipedia · CC BY-SA