GATE Exam | Aptitude Questions | GATE Syllabus | GATE Result | Mock Test | GATE Preparation
0 votes

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?

A

For every subset of k vertices, the induced subgraph has at most 2k-2 edges

B

The minimum cut in G has at least two edges

C

There are two edge-disjoint paths between every pair to vertices

D

There are two vertex-disjoint paths between every pair of vertices

asked in Graphs by gate

1 Answer

0 votes
There are two vertex-disjoint paths between every pair of vertices
answered by gate

Related questions

The best answer to any question