On the Hamiltonian index (Q1099188): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:11, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Hamiltonian index |
scientific article |
Statements
On the Hamiltonian index (English)
0 references
1988
0 references
The author defines h(G) as the smallest number m such that the m times iterated line graph has a Hamiltonian cycle and \(\ell (G)\) as the largest number k such that G has a path of length k which is not part of a \(K_ 3\) and whose internal vertices all have degree 2 in G. Theorem: h(G)\(\leq \ell (G)+1\) for every connected graph G which is not a path.
0 references
Hamiltonian cycle
0 references
