Let T = (V, E) be a tree where |V| = n. Suppose that for each v

Question:

Let T = (V, E) be a tree where |V| = n. Suppose that for each v ∈ V, deg(v) = 1 or deg(v) ≥ m, where m is a fixed positive integer and m ≥ 2.
(a) What is the smallest value possible for n?
(b) Prove that T has at least m pendant vertices.
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Question Posted: