A graph \(T\) is a tree if and only if between every pair of distinct vertices of \(T\) there is a unique path.