| |
|
A complete bipartite graph is a graph with vertices segregated into two sets, where an edge connects every pair of vertices where they are not in the same set.
Complete graphs on n vertices, for n between 1 and 8, are shown below:
| n | Kn | n | Kn |
|---|---|---|---|
| 1 |  |
5 |  |
| 2 |  |
6 |  |
| 3 |  |
7 |  |
| 4 |  |
8 |  |