Let C be a cycle. The square of C is the graph obtained by joining eve
ry pair of vertices of distance 2 in C Let G be a graph on n vertices
with minimum degree delta(G). This paper proves that, if delta(G) grea
ter-than-or-equal-to 5/7n, then G contains the square of a Hamiltonian
cycle.