循环图邻接矩阵的第二大特征值OA
The second largest eigenvalue of the adjacency matrix of circulant graphs
图的邻接矩阵特征值估计是图论与代数图论中的核心课题之一,其研究不仅揭示了图的结构性质,还在网络分析、复杂系统建模等领域有广泛应用.利用数学分析的方法,研究几类特殊循环图的邻接矩阵的第二大特征值上界问题,得到几个有创新意义的结果.
The estimation of the eigenvalues of the adjacency matrix of a graph is one of the core topics in graph theory and algebraic graph theory.Its research not only reveals the structural properties of the graph but also has wide applications in network analysis,complex system modeling,and other fields.By using the methods of mathematical analysis,this paper studies the upper bound of the second largest eigenvalue of the adjacency matrix of several special classes of circulant graphs and obtains several innovative results.
李俊杰
湖南幼儿师范高等专科学校 小学教育学院,湖南 常德 415000
数理科学
循环图邻接矩阵第二大特征值上界
circulant graphadjacency matrixsecond largest eigenvalueupper bound
《高师理科学刊》 2026 (3)
36-40,5
湖南省教育科学"十四五"规划2025年度立项课题(XJK25CJC008)
评论