Prove the following. If in a graph any two vertices are connected by a unique path, the

Question:

Prove the following.
If in a graph any two vertices are connected by a unique path, the graph is a tree.

Data from Prob. 14

Prove the following.
The path connecting any two vertices u and v in a tree is unique.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: