On traceable iterated line graph and hamiltonian path index

preprint2020arXivOpen access

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 n≥2n\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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.