Ore’s theoremLet G be a simple graph of order n≥3 such that, for every pair of distinct non adjacent vertices u and v, deg(u)+deg(v)≥n.Then G is a Hamiltonian graph.