+1 vote
in Data Structures & Algorithms I by (88.2k points)
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 Answer

+1 vote
by (737k points)
selected by
 
Best answer
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.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...