T is a graph with n vertices. T is connected and has exactly n-1 edges, then:
A. T is a tree
B. T contains no cycles
C. Every pairs of vertices in T is connected by exactly one path
D. All of these
Answer:D
T is a graph with n vertices. T is connected and has exactly n-1 edges, then:
A. T is a tree B. T contains no cycles C. Every pairs of vertices in T is connected by exactly one path D. All of these