图的最小特征值定义为图的邻接矩阵的最小特征值,是刻画图结构性质的一个重要代数参数.在所有给定阶数的补图为2-点或2-边连通的图中,刻画了最小特征值达到极小的唯一图,并给出了这类图最小特征值的下界.
The least eigenvalue of a graph is defined as the least eigenvalue of the 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 2-vertex connected or 2-edge connected, and present a lower bound for the least eigenvalue of such graphs.