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

Download Answer

Learn more about our help with Assignments: Discrete Math

Comments

No comments. Be the first!

Leave a comment

Related Questions

1. The complete graph k6 has how many different Hamiltonian circuits? a) 6 b) 720 c) 120 d) 60
2. Let P(x) is a predicate and the domain of x is the set of all real numbers,let R be “∀x∈Z.P(
3. The maximum number of perfect matching in a complete bipartite graph Kn,n is a) n! b) 2n c) n2 d) n
4. Different partially ordered sets may be represented by the same Hasse diagramif they are a) same b)
5. explain why a finite automaton does or does not correspond to a graph
6. when is a set said to be poset
7. prove that 1^2+3^2+5^2+...+(2n+1)^2 = (n+1)(2n+1)(2n+3)/3 whenever n is a nonnegative integer.

Who Can Help Me with My Assignment

There are three certainties in this world: Death, Taxes and Homework Assignments. No matter where you study, and no matter…
How to Finish Assignments When You Can’t

Crunch time is coming, deadlines need to be met, essays need to be submitted, and tests should be studied for.…
How to Effectively Study for a Math Test

Numbers and figures are an essential part of our world, necessary for almost everything we do every day. As important…