Mathematics · Graph Theory
According to Dirac's Theorem, if G is a simple graph with n vertices (n ≥ 3), a sufficient condition for G to have a Hamiltonian circuit is that:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1the degree of every vertex in G is at least n2.✓
- 2the degree of every vertex is at least n + 12.
- 3the degree of each vertex is equal to n.
- 4the degree of each vertex is at most n2.
Correct answer
the degree of every vertex in G is at least n2.
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 Mathematics?
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 Mathematics · Graph Theory