Computer Science · Graph Theory
Given below are two statements: Statement I: If a connected simple planar graph G has e edges and v vertices (for v ≥ 3), then 3v - e ≥ 6. Statement II: Any connected graph is called an Eulerian Graph if and only if all its vertices are of even degree. In light of the above statements, choose the most appropriate answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Both Statement I and Statement II are correct
- 2Both Statement I and Statement II are incorrect
- 3Statement I is correct and Statement II is incorrect
- 4Statement I is incorrect and Statement II is correct✓
Correct answer
Statement I is incorrect and Statement II is correct
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