Let $G(V,E)$ be a simple connected graph of order $n$. A graph of order $n$ is called pancyclic if it contains all the cycles $C_k$ for $k\in \{3,4,\cdot\cdot\cdot,n\}$. In this paper, some new spectral sufficient conditions for the graph to be pancyclic are established in terms of the edge number, the spectral radius and the signless Laplacian spectral radius of the graph.

中文翻译：

---

图为全圈图的一些光谱充分条件

令$ G（V，E）$为阶次$ n $的简单连通图。如果订单$ n $包含\ {3,4，\ cdot \ cdot \ cdot \ cdot，n \} $中所有$ k \的所有循环$ C_k $，则该图称为全循环图。在本文中，根据图的边数，谱半径和无符号拉普拉斯谱半径，为图成为全圈图建立了一些新的光谱充分条件。