摘要
图的最小特征值定义为图的邻接矩阵的最小特征值,它是刻画图的结构性质的重要参数.在给定阶数且补图为具有悬挂点的连通图的图类中,刻画了最小特征值达极小的唯一图,并给出了这类图最小特征值的下界.
The least eigenvalue of the graph is defined as the smallest eigenvalue of adjacency matrix of the graph,which is an important algebraic parameter on characterizing structural property of graphs.In this paper,we characterize the unique graph with the minimum least eigenvalue among all graphs of fixed order whose complements are connected and have pendent vertices,and present the lower bound of the least eigenvalue of such classes of graphs.
作者
余桂东
孙威
芦兴庭
YU Guidong;SUN Wei;LU Xingting(School of Mathematics and Computation Sciences,Anqing Normal University,Anqing 246133,Anhui,China;Basic Department,Hefei Preschool Education College,Hefei 230013,China)
出处
《运筹学学报》
北大核心
2019年第1期90-96,共7页
Operations Research Transactions
基金
国家自然科学基金(No.11671164)
安徽省自然科学基金(No.1808085MA04)
安徽省高校自然科学基金(No.KJ2017A362)
关键词
图
补图
邻接矩阵
最小特征值
graph
complement
adjacency matrix
the least eigenvalue
