Bipertile graph
A graph G=(V, E) is called a bipartite graph if its vertices V can be partitioned into two subsets V1 and V2 such that each edge of G connects a vertex of V1 to a vertex V2. It is denoted by Kmn, where m and n are the numbers of vertices in V1 and V2 respectively.
Example: Draw the bipartite graphs K2, 4and K3 ,4.Assuming any number of edges.
Solution: First draw the appropriate number of vertices on two parallel columns or rows and connect the vertices in one column or row with the vertices in other column or row. The bipartite graphs K2,4 and K3,4 are shown in fig respectively.
