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.">
让 G 是一个简单图至少有三个。我们表明, G 是Hamiltonian-connected Hamiltonian-connected当且仅当其强劲的闭包。我们也提供一个有效的算法来计算强烈的关闭 G 。