Abstract
In this note, we show a sharp lower bound of min{∑i=1kdG(ui):u1u2…uk is a path of (2-)connected G on its order such that (k-1)-iterated line graphs Lk−1(G) are hamiltonian.
Original language | English |
---|---|
Pages (from-to) | 403-411 |
Number of pages | 9 |
Journal | Applied Mathematics |
Volume | 36 |
Issue number | 3 |
DOIs | |
Publication status | Published - Sept 2021 |
Keywords
- 05C07
- 05C45
- 05C76
- degree sum condition
- hamiltonian index
- iterated line graph