A graph $G$ is called acyclic if it has no cycles. A tree is an acyclic connected graph.

• Every two vertices of a tree $T$ are connected by a unique path.
• Every nontrivial tree has at least two end-vertices.
• If $T$ is a tree of order $n$, then the size of the tree is $m=n-1$.
• Additional definitions