UGC-NET | UGC NET CS 2015 Dec – II | Question 4
Consider the graph given below:
The two distinct sets of vertices, which make the graph bipartite are:
(A) (v1, v4, v6); (v2, v3, v5, v7, v8)
(B) (v1, v7, v8); (v2, v3, v5, v6)
(C) (v1, v4, v6, v7); (v2, v3, v5, v8)
(D) (v1, v4, v6, v7, v8); (v2, v3, v5)
Explanation: A Bipartite Graph is a graph whose vertices can be divided into two independent sets, U and V such that every edge (u, v) either connects a vertex from U to V or a vertex from V to U. In other words, for every edge (u, v), either u belongs to U and v to V, or u belongs to V and v to U. We can also say that there is no edge that connects vertices of same set.
(v1, v4, v6, v7);
(v2, v3, v5, v8) is a bipartite graph vertices set.
So, option (C) is correct.
Quiz of this Question