Let G be a simple graph of order at least three. We show that G is Hamiltonian-connected
if and only if its strong closure is Hamiltonian-connected. We also give an efficient
algorithm to compute the strong closure of G.
Copyright © 1997 Hindawi Publishing Corporation. This is an open access article distributed under the
Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.