62 552
Assignments Done
98,8%
Successfully Done
In June 2018

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)
Expert's answer

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be first!

Leave a comment

Ask Your question

Submit
Privacy policy Terms and Conditions