Follow Us :

DT Q26

0. G is a graph on n vertices and 2n - 2 edges. The edges of G can be partitioned into two edge disjoint spanning trees. Which of the following is NOT true for G?

  • 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.
Cancel reply
Cancel reply