Vidyalelo
Data Structure · Q600

Miscellaneous on Data Structures

Programming · Data Structure · question 600

Q600

In a complete bipartite graph Km, n, the minimum vertex cover is of the size maxm, n.

A.
True
B.
False
Answer

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board