数学物理学报(英文版) ›› 1998, Vol. 18 ›› Issue (2): 212-220.
李相文
Li Xiangwen
摘要： This paper shows that if G is a connected graph of order n such that σ2(G) > 2(n/5-1) and L(G) is hamiltonian, then, for n ≥ 43, L(G) is pancyclic. Using the result of Veldman[8] this result settles the conjecture of Benhocine, et.al[1]:Let G be a connected almost bridgeless graph of order n such that σ2(G) > 2(n/5-1).If n is sufficintly large,L(G) is pancyclic.