DT Q26
- Option : D
- Explanation : Minimum number of edges for a connected
graph = n
and for a connected tree = n – 1
Here given that 2 n – 2 edges and the edges of
graph is partitioned into two edge disjoint trees.
So there are two vertex disjoint paths between
every pair of vertices.
Accessibility
Oversized Widget
Saved in this browser. Nothing changes for anyone else.