Similarly, took other vertexes and try to adjust them in the same two sets by remembering the

conditions
Here, we succeeded to divide the graph into two sets meeting the conditions

Therefore G1 is a bipartite graph.

G2: Again start with the vertex of the highest degree, here that is w2

Now try with another vertex say x2 ,Here we can't put x2 in the set containing r2 because they are
connected, so put x2 in the set containing w2 , Now we have to put all other connected vertexes of x2 ,
but this time we can't do it because x2 is connected to y2 and y2 is connected to z2
So, we fail to divide the graph into two sets meeting the bipartite conditions.

Therefore, G2 is not a bipartite graph.

Likes: 0 Dislikes: 0