科研之友
微信
新浪微博
Facebook
分享链接
摘要
In 1989, Zhu, Li and Deng introduced the definition of implicit degree, denoted by id(v), of a vertex v in a graph G and they obtained sufficient conditions for a graph to be hamiltonian with the implicit degrees. In this paper, we prove that if G is a 2-connected graph of order n with alpha(G) <= n/2 such that id(v) >= (n - 1)/2 for each vertex v of G, then G is hamiltonian with some exceptions.
