The pair is called a bipartition of , and are called the subsets of the bipartition.
As the name suggests, a bipartite graph’s partition only contains two subsets.
The following graph is bipartite since is a partition of that satisfies the necessary conditions.
We can also have complete bipartite graphs.
A bipartite graph can’t have any loops.