Definition:Complete Bipartite Graph

Definition
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}$.

Also see

 * Basic Properties of Complete Bipartite Graph