Biggs, N. L. Algebraic Graph Theory, 2nd ed. Cambridge, England: Cambridge University Press, 1993.Buekenhout, F. and Parker, M. "The Number of Nets of the Regular Convex Polytopes in Dimension ." Disc. Math.186, 69-94, 1998.Cvetković, D. M.; Doob, M.; and Sachs, H. Spectra of Graphs: Theory and Applications, 3rd rev. enl. ed. New York: Wiley, 1998.DeLaVina, E. "On Some History of the Development of Graffiti." It Graphs and Discovery DIMACS: Series in Discrete Mathematics and Theoretical Computer Science69, 81-118.2005.Haemers, W. H. "Spectral Characterization of Graphs." In IPM Combinatorics II: Design Theory, Graph Theory, and Computational Methods. April 22-27, 2006, IPM, Tehran. http://www.ipm.ac.ir/combinatoricsII/abstracts/Haemers1.pdf.Roucairol, M. and Cazenave, T. "Refutation of Spectral Graph Theory Conjectures with Search Algorithms." 27 Sep 2024. https://arxiv.org/abs/2409.18626.Skiena, S. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Reading, MA: Addison-Wesley, p. 85, 1990.van Dam, E. R. and Haemers, W. H. "Spectral Characterizations of Some Distance-Regular Graphs." J. Algebraic Combin.15, 189-202, 2003.Wilf, H. "Graphs and Their Spectra: Old and New Results." Congr. Numer.50, 37-43, 1985.
重退化特征值 
的图 
的谱通常表示为 
(van Dam 和 Haemers 2003) 或 
(Biggs 1993, p. 8; Buekenhout 和 Parker 1998)。
的谱元素上的乘积 
被称为 
的特征多项式，它由 
的邻接矩阵关于变量 
的特征多项式给出。
是正则图，则连通图 
的最大顶点度是 
的特征值 当且仅当 。
." Disc. Math. 186, 69-94, 1998.Cvetković, D. M.; Doob, M.; and Sachs, H.