A graph is connected and a acyclic iff there exists a unique path between every pair of vertices. Proof: ($\impliedby$) path existence implies graph is connected. The contrapositive is true: cycle implies non-uniqueness of paths. ($\implies$) Since graph is connected, there is at least one path between two vertices. Suppose there exists vertices with two paths. Then we can construct a cycle.