Which graph has a size of minimum vertex cover equal to maximum matching?
|Answer» D. bipartite|
|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