Definition: Leaf
A leaf of an undirected graph is a vertex \(v\) with degree \(d(v)=1\).
Mentioned in:
Definitions: 1 2
Lemmas: 3 4
Proofs: 5 6
Thank you to the contributors under CC BY-SA 4.0!
![](https://github.com/bookofproofs/bookofproofs.github.io/blob/main/_sources/_assets/images/calendar-black.png?raw=true)
- Github:
-
![bookofproofs](https://github.com/bookofproofs.png?size=32)
References
Bibliography
- Krumke S. O., Noltemeier H.: "Graphentheoretische Konzepte und Algorithmen", Teubner, 2005, 1st Edition