补图为2-点或2-边连通的图的最小特征值(英文)  

The least eigenvalue of graphs whose complements are 2-vertex or 2-edge connected

作　　者：余桂东[1,2] 范益政[1] 

机构地区：[1]安徽大学数学科学学院,合肥230601 [2]安庆师范学院数字与计算机科学学院,安徽安庆246011

出　　处：《运筹学学报》2013年第2期81-88,共8页Operations Research Transactions

基　　金：Supported by National Natural Science Foundation of China(No.11071002);Program for New Century Excellent Talents in University,Key Project of Chinese Ministry of Education(No.210091);Specialized Research Fund for the Doctoral Program of Higher Education(No.20103401110002);Science and Technological Fund of Anhui Province for Outstanding Youth(No.10040606Y33);National Science Foundation of the Department of Education of Anhui Province(Nos.KJ2011A195,KJ2010B136);Scientific Research Fund for Fostering Distinguished Young Scholars of Anhui University(No.KJJQ1001);Project for Academic Innovation Team of Anhui University(No.KJTD001B)

摘　　要：图的最小特征值定义为图的邻接矩阵的最小特征值,是刻画图结构性质的一个重要代数参数.在所有给定阶数的补图为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.

关 键 词：图 2-点连通 2-边连通 邻接矩阵 最小特征值 

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