On square-Hamiltonian graphs

K. D. Protasova

Abstract


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.


Keywords


square-Hamiltonian graphs, join of graphs, line graph, round-about reconstruction

Full Text:

PDF

Refbacks

  • There are currently no refbacks.