A Hamiltonian Graph is a graph with a spanning cycle. Hamiltonian Closure is the simple graph obtained from G by repeatedly adding edges joining pairs of nonadjacent vertices with degree sum at least |V (G)| until no such pair remains. Reference: Introduction to Graph Theory- D. B. West