Admin • 833K Points
Coach

Q. Which graph has a size of minimum vertex cover equal to maximum matching?

(A) cartesian
(B) tree
(C) heap
(D) bipartite

Correct Answer - Option(D)
Views: 27
Filed under category Design and Analysis of Algorithms
Hashtags:

Explanation by: Admin

the konig’s theorem given the equivalence relation between the minimum vertex cover and the maximum matching in graph theory. bipartite graph has a size of minimum vertex cover equal to maximum matching.

You must be Logged in to update hint/solution

Discusssion

Be the first to start discuss.

Mapped Tags:

Tag	Mapped By	Action