Answer to Question #8376 in Discrete Mathematics for Tina

Discrete Mathematics

Question #8376

Show that a connected graph of diameter k and minimum degree d has at least about kd/3 vertices but need not have substantially more.

Expert's answer

Answer in progress...

Learn more about our help with Assignments: Discrete Math

Comments

No comments. Be the first!

Leave a comment

Related Questions

1. It was proven during the previous lecture that 1+2+3+....+n=[n(n+1)]/2. Using that result, find t
2. If K is a constant, show that K(x-a) = o(x-a) [yes that is a "o" not a "0"] if a
3. Let a,b, c be integers. Prove that if a|b and a|(b+c) then a|c.
4. Use the sigma notation to indicate the sum of all odd integers from 3 through 7643 inclusive
5. The nine employes of the Ellington Dance Studio each earn $600 per week. A new employee is hired who
6. how can you prove that the size of complement of K r,s graph is (r 2) + (s 2)
7. Determine the value of n and M to show that (x2 + 8)(x + 1) is big-O(xn). (Find the value of the exp