Acta mathematica scientia,Series B ›› 1998, Vol. 18 ›› Issue (2): 212-220.
• Articles • Previous Articles Next Articles
Li Xiangwen
Received:
Online:
Published:
Supported by:
Abstract: 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.
Key words: Line graph, Hamilton cycle, pancyclicity
Li Xiangwen. PANCYCLICITY IN LINE GRAPHS[J].Acta mathematica scientia,Series B, 1998, 18(2): 212-220.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: http://121.43.60.238/sxwlxbB/EN/
http://121.43.60.238/sxwlxbB/EN/Y1998/V18/I2/212
Cited