Answer to Question #15597 in Discrete Mathematics for Sujata Roy

Question #15597

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)

## Comments

## Leave a comment