A

Admin • 828.03K Points
Coach

Q. Which theorem gives the relation between the minimum vertex cover and maximum matching?

  • (A) konig’s theorem
  • (B) kirchhoff’s theorem
  • (C) kuratowski’s theorem
  • (D) kelmans theorem
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

Login to discuss.

Be the first to start discuss.