Correct answer: (D) Every vertex pair has two vertex-disjoint paths.
Explanation
We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort
More Discrete Mathematics: Graphs (Connectivity, Matching, Colouring) questions
GATE 2007 CS Q4– Let G be a nonplanar graph with the minimum possible number of edges. G has