If G = (V, E) is a loop-free undirected graph, prove that G is a tree if

Question:

If G = (V, E) is a loop-free undirected graph, prove that G is a tree if there is a unique path between any two vertices of G.
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Question Posted: