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
Chapters: 1
Problems: 2
Solutions: 3
Theorems: 4 5 6