1 votes 1 votes If d(V) ≥ n/2 for each vertex V in G, then G is hamiltonian. [d(V) is the degree of a vertex V] True/False explain: srestha asked Feb 2, 2017 srestha 447 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Kapil commented Feb 2, 2017 reply Follow Share It is not neccessary always as one more condition should be checked . Deg(u) + Deg(v) >= Total number of vertices where, U and V are not adjacent. If both are true, then it is hamiltonian, but sometimes first condition gives the result. 1 votes 1 votes Prajwal Bhat commented Feb 2, 2017 reply Follow Share Ok thnx for the clarification 0 votes 0 votes sid1221 commented Jun 24, 2017 reply Follow Share both are not dependent to each other , both are sufficient condition , but converse is not true always ...in both theorem 1 votes 1 votes Please log in or register to add a comment.