Question: Problem 3. Let T = (V, E) be a tree. A leaf is a vertex v such that degT (v) = 1. Use the Handshake
Problem 3. Let T = (V, E) be a tree. A leaf is a vertex v such that degT (v) = 1. Use the Handshake Lemma to show that T has at least one leaf. BONUS: Show that T has at least two leaves (Hint: Handshake Lemma won't work for this).
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
