Characteristics of Finite Tree/Condition 3

Theorem

Let $T$ be a finite simple graph.

Then:

$T$ is a finite tree if and only if two arbitrary vertices of $T$ are connected by exactly one path.

Proof

This is an instance of:

Path in Tree is Unique.

$\blacksquare$