ISRO | ISRO CS 2009 | Question 50

In a graph G there is one and only one path between every pair of vertices then G is a
(A) Path
(B) Walk
(C) Tree
(D) Circuit

Answer: (C)
Explanation: A tree is a minimally connected graph i.e. removing a single edge will disconnect the graph. A tree with n vertices has n−1 edges and only one path exists between every pair of vertices.

So, option (C) is correct.
Quiz of this Question