In the given graph which edge should be removed to make it a Bipartite Graph?

Category: QuestionsIn the given graph which edge should be removed to make it a Bipartite Graph?
Editor">Editor Staff asked 4 weeks ago

In the given graph which edge should be removed to make it a Bipartite Graph?
 
(a) A-C
 
(b) B-E
 
(c) C-D
 
(d) D-E
 
This interesting question is from Undirected Graph in section Graph of Data Structures & Algorithms I
 
I got this question in final exam.

1 Answers
Editor">Editor Staff answered 4 weeks ago

Correct choice is (a) A-C
 
Easy explanation – The resultant graph would be a Bipartite Graph having {A,C,E} and  {D, B} as its subgroups.