首页|On traceable iterated line graph and hamiltonian path index

On traceable iterated line graph and hamiltonian path index

扫码查看
原文链接
  • NETL
  • NSTL
  • 万方数据
Xiong and Liu[21]gave a characterization of the graphs G for which the n-iterated line graph Ln(G)is hamiltonian,for n≥2.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.

iterated line graphtraceablehamiltonian indexhamiltonian path index

NIU Zhao-hong、XIONG Li-ming、YANG Wei-hua

展开 >

School of Mathematical Sciences,Shanxi University,Taiyuan 030006,China

School of Mathematics and Statistics,Beijing Key Laboratory on MCAACI,Beijing Institute of Tech-nology,Beijing 100081,China

Department of Mathematics,Taiyuan University of Technology,Taiyuan 030024,China

国家自然科学基金国家自然科学基金special fund for Science and Technology Innovation Teams of Shanxi ProvinceFundamental Research Program of Shanxi Province

1213101312371356202204051002015202303021221064

2024

10.1007/s11766-024-3905-2

高校应用数学学报B辑(英文版)
浙江大学 中国工业与应用数学学会

高校应用数学学报B辑(英文版)

影响因子：0.146
ISSN：1005-1031
年,卷(期)：2024.39(2)
  • 24