1
$\begingroup$

The Dirac's theorem states that: "For a Graph G with N vertices, if the degree of each vertex is atleast N/2 then, the Graph has a Hamilton Circuit." Can the same be said if a graph has a Hamilton Circuit then the degree of each vertex is atleast N/2 ?

$\endgroup$
0

1 Answer 1

3
$\begingroup$

No. A graph with only the edges of a polygon has an Hamilton circle, but the degree of each vertex is 2.

$\endgroup$
2
  • 1
    $\begingroup$ Such a graph is usually called a cycle or circuit. $\endgroup$ Commented Aug 7, 2019 at 7:21
  • $\begingroup$ I think that's the condition for an Euler Circuit to exist. @shuki $\endgroup$ Commented Aug 8, 2019 at 8:04

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.