On traceable iterated line graph and hamiltonian path index  

作　　者：NIU Zhao-hong XIONG Li-ming YANG Wei-hua 

机构地区：[1]School of Mathematical Sciences,Shanxi University,Taiyuan 030006,China [2]School of Mathematics and Statistics,Beijing Key Laboratory on MCAACI,Beijing Institute of Technology,Beijing 100081,China [3]Department of Mathematics,Taiyuan University of Technology,Taiyuan 030024,China

出　　处：《Applied Mathematics(A Journal of Chinese Universities)》2024年第2期239-252,共14页高校应用数学学报（英文版）（B辑）

基　　金：Supported by the Natural Science Foundation of China(12131013,12371356);the special fund for Science and Technology Innovation Teams of Shanxi Province(202204051002015);the Fundamental Research Program of Shanxi Province(202303021221064).

摘　　要：Xiong and Liu[21]gave a characterization of the graphs G for which the n-iterated line graph L^(n)(G)is hamiltonian,for n≥2.In this paper,we study the existence of a hamiltonian path in L^(n)(G),and give a characterization of G for which 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.

关 键 词：iterated line graph TRACEABLE hamiltonian index hamiltonian path index 

分 类 号：O157.5[理学—数学]