Authors: Hao Li Jun Qing Cai
Publish Date: 2013/08/15
Volume: 29, Issue: 9, Pages: 1773-1780
Abstract
In 1989 Zhu Li and Deng introduced the definition of implicit degree of a vertex v in a graph G denoted by idv In this paper we prove that if G is a 2connected graph of order n such that idu+idv ≥ 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 F 4r
Keywords: