Let T be a nontrivial tree of order n and let S be a set of vertices of T . By T = T
Chapter 13, Problem 22(choose chapter or problem)
Let T be a nontrivial tree of order n and let S be a set of vertices of T . By T = T (S), we mean a subtree of T of minimum size such that S V (T ). (a) Prove that _(T ) |S|. Show that it is possible for _(T ) < |S|. (b) Determine the minimum cardinality of a set S V (T ) such that T (S) = T .
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