摘要
In this letter, we only consider simple graphs. Suppose that G is a graph with n vertices. If G contains a cycle of length n, then we say that G is Hamiltonian. If G contains a cycle of length k for each k, 3 ≤k≤n, then G is pancyclic. We say that G is a vertex-k-cycle graph if G contains a cycle
