◀ ▲ ▶Branches / Graph-theory / Definition: Complete Graph

Definition: Complete Graph

A simple undirected graph \(G(V,E)\) with an order \(|G|=n\) is called a complete graph, if each vertex is joined to each of the others by exactly one edge.

The complete graph with \(n\) vertices is denoted by \(K_n\).

(c) bookofproofs

Mentioned in:

Chapters: 1
Problems: 2
Solutions: 3
Theorems: 4 5 6

Thank you to the contributors under CC BY-SA 4.0!

Github:

References

Bibliography

1. Aldous Joan M., Wilson Robin J.: "Graphs and Applications - An Introductory Approach", Springer, 2000