Computer Science · Graph Theory
Consider the following statements regarding an undirected graph: Statement I: In any undirected graph, the number of vertices with an odd degree is always even. Statement II: In any undirected graph, the sum of the degrees of all vertices is always even. Which of the following is correct?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Statement I is false but Statement II is true.
- 2Statement I is true but Statement II is false.
- 3Both Statement I and Statement II are false.
- 4Both Statement I and Statement II are true.✓
Correct answer
Both Statement I and Statement II are true.
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