Discrete Mathematics

A graph is bipartite if its vertices can be divided into two disjoint subsets U and V such that each edge connects a vertex from U to one from V.

Bipartite Graph (K₃,₃)
A bipartite graph is a complete bipartite graph if every vertex in U is connected to every vertex in V. If U has n elements and V has m, then we denote the resulting as complete bipartite graph by K_n,_m. Some examples of bipartite graph is

Bipartite Graph (K₂,₃)

Bipartite Graph (K₃,₃)

Bipartite Graph (K₃,₅)

Bipartite Graph (K₂,₆)

Draw the various combination of complete bipartite graph, in which graph has 7 vertices. some of the combinations are: k₁,₆, k₂,₅, k₃,₄, k₄,₃, k₅,₂, and k₆,₁.