Question

The complete bipartite graph Km,n has vertex covering number X and edge covering number Y. X and Y are respectively
a) max(m,n), min(m,n)
b) min(m,n), min(m,n)
c) m+n,mn
d) min(m,n),max(m,n)

Answer 1

From the definition of the complete bipartite graph $K_{m,n}$ (which has vertex that covering number $X$ and edge covering number $Y$) we can say that $X$ and $Y$ are respectively: $\min(m,n)$ and $\max(m,n)$.

So, the answer is d).

**Answer**: d) $\min(m,n)$, $\max(m,n)$.