A bipartite graph is a graph whose vertices can be divided into two disjoint and independent sets U and V such that every edge connects a vertex in U to one in V.
Fig: Bipartite Graph
Complete Bipartite Graph
A special kind of bipartite graph where every vertex of the first set is connected to every vertex of the second set.
Fig: Complete bipartite graph
Here, total vertices are 4 + 2 = 6 and so, edges = 4 x 2 = 8. This is a characteristics of complete bipartite graph.