Discussion:
Q: Show that this theorem is sharp, that is, show that for infinitely many n>=3 there are non-hamiltonian graphs G of order n such that degu+degv>=n-1 for all distinct nonadjacent u and v.
Can you explain this theorem,please
Theorem: If G is a graph of order n>=3 such that for all distinct nonadjacent vertices u and v, deg v +deg u >=n then G is hamiltonian.
Can you explain it step by step and draw a graph.