作者：Hao; LI; Jun; Qing; CAI泛圈图度条件id连通图顶点同构
摘要：In 1989, Zhu, Li and Deng introduced the definition of implicit degree of a vertex v in a graph G, denoted by id(v). In this paper, we prove that if G is a 2-connected graph of order n such that id(u) + id(v) ≥ n for each pair of nonadjacent vertices u and v in G, then G is pancyclic unless G is bipartite, or else n = 4r, r ≥ 2 and G is isomorphic to F4r .
注：因版权方要求，不能公开全文，如需全文，请咨询杂志社
