具有n-4个悬挂点的双圈补图的最小特征值的下界  

The Lower Bounds of the Least Eigenvalue of Complements of Bicyclic Graphs with n−4 Pendant Vertices

作　　者：周恋恋 刘康 孟吉翔[1] ZHOU Lianlian;LIU Kang;MENG Jixiang(School of Mathematics and System Sciences,Xinjiang University,Urumqi Xinjiang 830017,China)

机构地区：[1]新疆大学数学与系统科学学院,新疆乌鲁木齐830017

出　　处：《新疆大学学报（自然科学版）（中英文）》2024年第1期20-26,36,共8页Journal of Xinjiang University(Natural Science Edition in Chinese and English)

基　　金：新疆维吾尔自治区高校科研计划自然科学重点项目“图矩阵的特征值及其应用”(XJEDU2021I001)

摘　　要：图的最小特征值作为刻画图结构性质的参数具有重要的研究意义,且相比于谱半径,图的最小特征值研究较少.在补图简单无向且连通的情况下,通过运用相关知识分析,在有n-4个悬挂点的n阶双圈图集中刻画了最小邻接特征值的下界.The least eigenvalue as a parameter to characterize the structural properties of a graph,has important research value.Comparing with the spectral radius,the least eigenvalue of a graph is less studied.The graphs in this paper are simple,undirected and connected,and we characterize the lower bounds of the least adjacency eigenvalue of graphs in the set of bicyclic graphs with n vertices and n−4 pendant vertices by using relevant knowledge analysis and demonstration.

关 键 词：补图 双圈图 最小特征值 下界 

分 类 号：O157.5[理学—数学]