东南大学学报（自然科学版）2000，Vol.30Issue(6)：114-118,5.
泛圈图的一个新的充分条件
A New Sufficient Condition for Pancyclic Graphs
摘要
Abstract
Let G be a 2-connected simple graph of order n and αv denote the order of the largest inde
pendent set containing the vertex v in G. For any uv E, let Tuv =VN(u)∪N(v)),αuv=
min{αu,αv}. This paper proves that if for any non-adjacent vertices u, v, ｜N(u)∩N(v)｜≥
min {αuv－1,｜Tuv｜}, then there exists cycle G of length k such that G contains vertex x for any vertex
x and any k(4≤k≤n),except some special graphs.
关键词
泛圈性/Hamilton图/充分条件Key words
pancyclicity/Hamilton graph/sufficient condition分类
数理科学引用本文复制引用
周小跃..泛圈图的一个新的充分条件[J].东南大学学报（自然科学版）,2000,30(6):114-118,5.
