On square-Hamiltonian graphs

A finite connected graph $G$ is called square-Hamiltonian if $G^{2}$ is Hamiltonian. We prove that any join of the family of Hamiltonian graphs by tree is square-Hamiltonian. Applying this statement we show that the line graph and any round-about reconstruction of an arbitrary finite connected graph is square-Hamiltonian.