1.

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-EThis interesting question is from Undirected Graph in section Graph of Data Structures & Algorithms II got this question in final exam.

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.



Discussion

No Comment Found

Related InterviewSolutions