Solved Paper-II On Topic : Solved Paper-II December 2005

Que : 1 . T is a graph with n vertices. T is connected and has exactly n-1 edges, then:

1. T is a tree
2. T contains no cycles
3. Every pairs of vertices in T is connected by exactly one path
4. All of these
Please Select Ans Options .
Explanation

MEMBERSHIP REQUIRED !