recategorized by
2,150 views
3 votes
3 votes

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)
 

recategorized by

2 Answers

Best answer
3 votes
3 votes

hope this helps

selected by
0 votes
0 votes
a graph is bipartite if it satisfies  2-colorable properties you can check with above graph so answer will be C.)

Related questions

0 votes
0 votes
2 answers
1
1 votes
1 votes
0 answers
3
srestha asked Sep 21, 2018
1,766 views
Which of the following complete bipartite graphs will have Hamiltonian cycle?$a)K_{3,3}$$b)K_{2,4}$
0 votes
0 votes
1 answer
4
neha singh asked Oct 11, 2016
3,252 views
What is largest number of maximal independent set of complete bipartite graph K(4,2)?a)2b)3c)4d)6