CONDITIONS FOR GRAPHS ON <i>n</i> VERTICES WITH THE SUM OF DEGREES OF ANY TWO NONADJACENT VERTICES EQUAL TO<i> n-2</i> TO BE A HAMILTONIAN GRAPH

Abstract

Let G be an undirected simple graph on \(n \geq 3\) vertices with the degree sum of any two nonadjacent vertices in G equal to \(n - 2\). We determine the condition for G to be a Hamiltonian graph.