|
Algebra and Discrete Mathematics, 2005, Issue 3, Pages 56–59
(Mi adm312)
|
|
|
|
RESEARCH ARTICLE
On square-Hamiltonian graphs
K. D. Protasova Department of Cybernetics, Kyiv University, Volodimirska 64, Kyiv 01033, Ukraine
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.
Received: 15.08.2005 Revised: 10.09.2005
Citation:
K. D. Protasova, “On square-Hamiltonian graphs”, Algebra Discrete Math., 2005, no. 3, 56–59
Linking options:
https://www.mathnet.ru/eng/adm312 https://www.mathnet.ru/eng/adm/y2005/i3/p56
|
Statistics & downloads: |
Abstract page: | 117 | Full-text PDF : | 62 | First page: | 1 |
|