Solved: Show that a simple graph is a tree if and only if
Chapter 10, Problem 10.1.14(choose chapter or problem)
Show that a simple graph is a tree if and only if it is connected, but the deletion of any of its edges produces a graph that is not connected.
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