On traceable iterated line graph and hamiltonian path index

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 G for which the n-th iterated line graph Ln(G) is hamiltonian, for n2. In this paper, we study the existence of a hamiltonian path in Ln(G), and give a characterization of G for which Ln(G) has a hamiltonian path. As applications, we use this characterization to give several upper bounds on the hamiltonian path index of a graph.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…