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)
There are two edge-disjoint paths between every pair to vertices
(B)
The minimum cut in G has at least two edges
(C)
For every subset of k vertices, the induced subgraph has at most 2k-2 edges
(D)
There are two vertex-disjoint paths between every pair of vertices
Answer
Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!