Bondy and Chvatal [7] introduced a general and unified approach to a variety of graph-theoretic problems. They defined the k-closure Ck(G), where k is a positive integer, of a graph G of order n as the graph obtained from G by recursively joining pairs of nonadjacent vertices a,b satisfying the...