| 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 |
| Answer» A. konig’s theorem | |
| Explanation: 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. | |
Login to Continue
It will take less than 2 minutes