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)
1
Expert's answer
2012-10-26T09:29:11-0400
The answer to the question is available in the PDF file https://assignmentexpert.com/homework-answers/mathematics-answer-15597.pdf

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!

Place free inquiry
Calculate the price
Learn more about our help with Assignments: Discrete Math

Comments

No comments. Be the first!
Our fields of expertise
Submit Your Assignment. We Can Do It.
LATEST TUTORIALS
APPROVED BY CLIENTS
"assignmentexpert.com" is professional group of people in Math subjects! They did assignments in very high level of mathematical modelling in the best quality. Thanks a lot
Canada #339914 on Dec 2023