3-连通无爪图的度和与泛圈性

DEGREE SUMS AND PANCYCLICITY IN 3 -CONNECTED CLAW - FREE GRAPHS

若图G中不含同构于K1,3的导出子图，则称G为无爪图．笔者讨论了3-连通爪图中三个顶点的度和与泛圈性之间的关系，给出了图是泛圈的一个充分条件，得到了如下结果：设图G是n阶3-连通无爪图，如果σ3（G）≥n＋1，则G是泛圈的．

A graph is claw- free if G has no induced subgraph isomorphic relations between degree sums and pancyclicity in 3 - connected claw - free to K1,3. In this paper, we study the graphs sufficient condition that a graph is pancyclic. The following result is proved：Let G be graph of order n,if σ3（G）≥n＋1, ,then G is pancyclic. , and it gives a sufficient a a 3 - connected claw - free