Page "Tree (graph theory)" Paragraph 30

* Every finite tree with n vertices, with, has at least two terminal vertices ( leaves ).

This minimal number of terminal vertices is characteristic of path graphs ; the maximal number,, is attained by star graphs.