A simple upper bound for the hamiltonian index of a graph (Q1339866): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:59, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple upper bound for the hamiltonian index of a graph |
scientific article |
Statements
A simple upper bound for the hamiltonian index of a graph (English)
0 references
16 January 1995
0 references
The main result of this paper states that if \(G\) is a connected graph on \(n\) vertices, with the maximum degree \(\Delta\) and distinct from a path, then the \(n-\Delta\) iterated line graph of \(G\) is hamiltonian.
0 references
upper bound
0 references
hamiltonian index
0 references
hamiltonian cycles
0 references
line graph
0 references
