1 votes 1 votes DIRAC’S THEOREM: If G is a simple graph with n vertices with n ≥ 3 such that the degree of every vertex in G is at least n/2, then G has a Hamilton circuit. The below graph does not follow the above rule but still have a Hamilton circuit. Graph Theory graph-theory hamilton-circuit dirac-theorem + – CJ147 asked Aug 25, 2018 • recategorized Aug 25, 2018 by Shaik Masthan CJ147 462 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Shaik Masthan commented Aug 25, 2018 reply Follow Share @CJ147, DIRAC’S THEOREM is sufficient theorem but not the necessary theorem. 1 votes 1 votes CJ147 commented Aug 26, 2018 reply Follow Share Thanks 0 votes 0 votes Please log in or register to add a comment.
