\begin{definition}[Definition:Complete Bipartite Graph]
A '''complete bipartite graph''' is a bipartite graph $G = \struct {A \mid B, E}$ in which every vertex in $A$ is adjacent to every vertex in $B$.
The complete bipartite graph where $A$ has $m$ vertices and $B$ has $n$ vertices is denoted $K_{m, n}$.
Note that $K_{m, n}$ is the same as $K_{n, m}$.
\end{definition}