Leaf

Leaf --- лист.

1. See Directed tree.

2. A leaf is a vertex of degree one.

3. See Directed hyperpath.

4. A leaf is any 2-edge-connected subgraph, trivial or not, maximal with respect to inclusion. Thus every vertex belongs to a unique leaf of a graph. The number of leaves of $H$ is denoted by $l(H)$.