设C=（y，司是一个n阶简单图，若对于每一个k（3≤k≤n），G都含有长度为k的圈Gk则称G为泛圈图。利用图的闭包理论研究图的补图谱半径的界，讨论了泛圈图存在的一个谱条件。%Letbe a simple graph of order, is called pancyclic graph if it contains a cycle of length for all . In this paper we discuss the existence of some spectral conditions of pancyclic graph by using bounds of spectral radius with closure theory of the Complement of a graph.
展开▼
