Q42

MCQ2 marks, −0.5

$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 $2$ edges.

(C)

There are at least $2$ edge-disjoint paths between every pair of vertices.

(D)

There are at least $2$ vertex-disjoint paths between every pair of vertices.

Loading…