A graph is said to be bipartite if we can divide the set of vertices in two disjoint sets such that there is no edge between vertices belonging to same set.
In a bipartite graph, the sum of degrees of vertices of
each set is equal to the number of edges.
Examples of Bipartite Graph
K2,3
K3,4
K4,5
K1,5
K2,4
