高师理科学刊2026，Vol.46Issue(3)：36-40,5.DOI:10.3969/j.issn.1007-9831.2026.03.005
循环图邻接矩阵的第二大特征值
The second largest eigenvalue of the adjacency matrix of circulant graphs
摘要
Abstract
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.关键词
循环图/邻接矩阵/第二大特征值/上界Key words
circulant graph/adjacency matrix/second largest eigenvalue/upper bound分类
数理科学引用本文复制引用
李俊杰..循环图邻接矩阵的第二大特征值[J].高师理科学刊,2026,46(3):36-40,5.基金项目
湖南省教育科学"十四五"规划2025年度立项课题(XJK25CJC008) （XJK25CJC008）
