M

Mr. Dubey • 100.69K 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
Share
Explanation by: Mr. Dubey
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.

Related MCQs

Q. For the model, the security boundary may be defined for the vendor to include the software framework and middleware layer.

Q. If it is possible to extend each pair of consistent variable instantiation to a third variable, a CSP is said to be

Q. The operation which is not considered a basic operation of relational algebra is

Q. ………………….. operator is basically a join followed by a project on the attributes of first relation.

Q. Which one of the following is a version of UDP with congestion control?

Q. Which of the following is true of signature-based IDSes?

Q. Which of the IP headers decides when the packet should be discarded?

Q. ,2,3],"check")

Q. Which of the following policies is not mentioned in ‘not to violate’ regarding CloudBurst?

Q. Select the command which is used to pause execution until the page is loaded completely

Question analytics