Subscribe to the weekly news from TrueShelf

0

Leaves in a tree

  • Prove that every tree has at least two leaves (i.e., vertices of degree \(1\)).

  • Prove that every tree with maximum degree \(\Delta>1\) has at least \(\Delta\) leaves.

Related Content