In 1116, a graph with no loops or more than one edge
Chapter 14, Problem 11(choose chapter or problem)
In Exercises 11-16, a graph with no loops or more than one edge between any two vertices is described. Which one of the following applies to the description?
i. The described graph is a tree.
ii. The described graph is not a tree.
iii. The described graph may or may not be a tree.
The graph has five vertices, and there is exactly one path from any vertex to any other vertex.
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