On square-Hamiltonian graphs

• Veröffentlicht in: Algebra and Discrete Mathematics
• Datum: 2005
• 1. Verfasser: Protasova, K.D.
• Format: Artikel
• Sprache: Englisch
• Veröffentlicht: Інститут прикладної математики і механіки НАН України 2005
• Online Zugang: https://nasplib.isofts.kiev.ua/handle/123456789/157198
• Назва журналу: Digital Library of Periodicals of National Academy of Sciences of Ukraine
• Zitieren: On square-Hamiltonian graphs / K.D. Protasova // Algebra and Discrete Mathematics. — 2005. — Vol. 4, № 3. — С. 56–59. — Бібліогр.: 7 назв. — англ.

A finite connected graph G is called squareHamiltonian if G² 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...