Q118
Which graph has a size of minimum vertex cover equal to maximum matching?
A.
Cartesian
B.
Tree
C.
Heap
D.
Bipartite
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board