On square-Hamiltonian graphs
Vernadsky National Library of Ukraine
Переглянути архів Інформація| Поле | Співвідношення | |
| Title |
On square-Hamiltonian graphs
|
|
| Creator |
Protasova, K.D.
|
|
| Description |
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 square-Hamiltonian. |
|
| Date |
2019-06-19T17:32:22Z
2019-06-19T17:32:22Z 2005 |
|
| Type |
Article
|
|
| Identifier |
On square-Hamiltonian graphs / K.D. Protasova // Algebra and Discrete Mathematics. — 2005. — Vol. 4, № 3. — С. 56–59. — Бібліогр.: 7 назв. — англ.
1726-3255 2000 Mathematics Subject Classification: 05C45. http://dspace.nbuv.gov.ua/handle/123456789/157198 |
|
| Language |
en
|
|
| Relation |
Algebra and Discrete Mathematics
|
|
| Publisher |
Інститут прикладної математики і механіки НАН України
|
|