Warning: count(): Parameter must be an array or an object that implements Countable in /home/customer/www/thegatebook.in/public_html/qa/qa-include/qa-theme-base.php on line 177

# DM - Grand Test -Q22

Warning: count(): Parameter must be an array or an object that implements Countable in /home/customer/www/thegatebook.in/public_html/qa/qa-include/qa-theme-base.php on line 177
+1 vote

Let $\dpi{100} K_{m,n}$ is complete bipartite graph with m +n vertices.

Determine the vertex covering number of $\dpi{100} K_{m,n}$

(A) m + n

(B) |m - n|

(C) Minimum (m,n)

(D) Maximum (m,n)