English

On traceable iterated line graph and hamiltonian path index

Combinatorics 2021-01-01 v1

Abstract

Xiong and Liu [L. Xiong and Z. Liu, Hamiltonian iterated line graphs, Discrete Math. 256 (2002) 407-422] gave a characterization of the graphs GG for which the nn-th iterated line graph Ln(G)L^n(G) is hamiltonian, for n2n\ge2. In this paper, we study the existence of a hamiltonian path in Ln(G)L^n(G), and give a characterization of GG for which Ln(G)L^n(G) has a hamiltonian path. As applications, we use this characterization to give several upper bounds on the hamiltonian path index of a graph.

Keywords

Cite

@article{arxiv.2012.14551,
  title  = {On traceable iterated line graph and hamiltonian path index},
  author = {Zhaohong Nou and Liming Xiong and Weihua Yang},
  journal= {arXiv preprint arXiv:2012.14551},
  year   = {2021}
}

Comments

12pages

R2 v1 2026-06-23T21:31:53.884Z