If in a graph any two vertices are connected by a unique
Chapter 23, Problem 23.4(choose chapter or problem)
If in a graph any two vertices are connected by a unique path, the graph is a tree.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer