On square-Hamiltonian graphs
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...
Gespeichert in:
| Veröffentlicht in: | Algebra and Discrete Mathematics |
|---|---|
| Datum: | 2005 |
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | English |
| Veröffentlicht: |
Інститут прикладної математики і механіки НАН України
2005
|
| Online Zugang: | https://nasplib.isofts.kiev.ua/handle/123456789/157198 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | 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 назв. — англ. |
Institution
Digital Library of Periodicals of National Academy of Sciences of Ukraine| Zusammenfassung: | 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.
|
|---|---|
| ISSN: | 1726-3255 |