共 50 条
PANCYCLICITY IN LINE GRAPHS
被引:0
|作者:
李相文
机构:
关键词:
Line graph;
Hamilton cycle;
pancyclicity;
D O I:
暂无
中图分类号:
O157.5 [图论];
学科分类号:
070104 ;
摘要:
This paper shows that if G is a connected graph of order n such that σ2(G)>2(-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 If n is sufficintly large,L(G) is pancyclic.
引用
收藏
页码:212 / 220
页数:9
相关论文