Computer Science · Graph Theory
Let G be a 2-connected graph. Which of the following statements is always true for any two distinct vertices u and v?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1There exist at least two internally disjoint u-v paths✓
- 2There exist exactly two internally disjoint u-v paths
- 3u and v lie on exactly one common cycle
- 4There exist two edge-disjoint cycles containing both u and v
Correct answer
There exist at least two internally disjoint u-v paths
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Graph Theory MCQs →Want more practice questions on Graph Theory?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Graph Theory