◀ ▲ ▶Branches / Graph-theory / Lemma: Lower Bound of Leaves in a Tree

Lemma: Lower Bound of Leaves in a Tree

Every tree \(T\) of order \(|T|\ge 2\) has at least two leaves.

Table of Contents

Proofs: 1

Thank you to the contributors under CC BY-SA 4.0!

Github:

References

Bibliography

1. Aldous Joan M., Wilson Robin J.: "Graphs and Applications - An Introductory Approach", Springer, 2000