A tree with n vertices which has no vertices of degree 2 must have at least leaves
Answers
Answered by
0
Answer:
If T is a tree having no vertex of degree 2, then T has more leaves than internal nodes. Prove this claim by a) induction, b) by considering the average degree and using the handshaking lemma.
Similar questions