1.

Which graph has a size of minimum vertex cover equal to maximum matching?

A. Cartesian
B. Tree
C. Heap
D. Bipartite
Answer» E.


Discussion

No Comment Found