#CS-6105
Awesome StudentQuestion • Discrete Mathematics
Proposition 4.2.1
Answer
A graph T is a tree if and only if between every pair of distinct vertices of T there is a unique path.
A graph T is a tree if and only if between every pair of distinct vertices of T there is a unique path.