Computer Science · Graph Theory
Consider the following statements regarding graph connectivity metrics: Statement 1: Vertex connectivity is defined as the minimum number of vertices whose removal disconnects the graph or reduces it to a single vertex. Statement 2: The edge connectivity of a graph can exceed its minimum degree, as disconnecting the graph always requires removing more edges than those incident to a single minimum-degree vertex.
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Statement 1 is false, but Statement 2 is true.
- 2Statement 1 is true, but Statement 2 is false.✓
- 3Both statements are false.
- 4Both statements are true.
Correct answer
Statement 1 is true, but Statement 2 is false.
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