(a) By Theorem 13.5, the minimum number of leaves in a tree of order n 3 is 2. What is
Chapter 13, Problem 6(choose chapter or problem)
(a) By Theorem 13.5, the minimum number of leaves in a tree of order n 3 is 2. What is the maximum number of leaves that a tree of order n 3 can contain? (b) Show, for every two integers k and n with 2 k n1, that there exists a tree of order n containing exactly k leaves.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer