Hamiltonian cycles in the square of a graph (Q648391)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5976481
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hamiltonian cycles in the square of a graph |
scientific article; zbMATH DE number 5976481 |
Statements
Hamiltonian cycles in the square of a graph (English)
0 references
22 November 2011
0 references
Summary: We show that under certain conditions the square of the graph obtained by identifying a vertex in two graphs with hamiltonian square is also hamiltonian. Us- ing this result, we prove necessary and sufficient conditions for hamiltonicity of the square of a connected graph such that every vertex of degree at least three in a block graph corresponds to a cut vertex and any two these vertices are at distance at least four.
0 references
Hamiltonian cycle
0 references
connection of graphs
0 references
block graph
0 references
square
0 references
star
0 references
0.8565765619277954
0 references
0.8498219847679138
0 references
0.8494129180908203
0 references
0.8298986554145813
0 references
