Which of the following scenarios results in a graph which is not a tree?
A) A graph with 5 vertices and 6 edges.
B) A graph in which every edge is a bridge.
C) A graph in which every pair of vertices has one unique path which connects them.
D) All of the above.
E) None of the above.

Question

Which of the following scenarios results in a graph which is not a tree? 
A) A graph with 5 vertices and 6 edges.
B) A graph in which every edge is a bridge.
C) A graph in which every pair of vertices has one unique path which connects them.
D) All of the above.
E) None of the above.

Quizplus · Accepted Answer

A graph with 5 vertices and 6 edges cannot be a tree because a tree with $n$ vertices always has $n-1$ edges.

Which of the Following Scenarios Results in a Graph Which