| 补图为2-点或2-边连通的图的最小特征值 |
| |
| 引用本文： | 余桂东,范益政.补图为2-点或2-边连通的图的最小特征值[J].运筹学学报,2013,17(2):81-88. |
| |
| 作者姓名： | 余桂东 范益政 |
| |
| 作者单位： | 1. 安徽大学数学科学学院, 合肥 230601 2. 安庆师范学院数字与计算机科学学院, 安徽安庆 246011 |
| |
| 基金项目： | Key Project of Chinese Ministry of Education，Specialized Research Fund for the Doctoral Program of Higher Education，Science and Technological Fund of Anhui Province for Outstanding Youth，National Science Foundation of the Department of Education of Anhui Province，Scientific Research Fund for Fostering Distinguished Young Scholars of Anhui University，Project for Academic Innovation Team of Anhui University |
| |
| 摘 要： | 图的最小特征值定义为图的邻接矩阵的最小特征值，是刻画图结构性质的一个重要代数参数. 在所有给定阶数的补图为2-点或2-边连通的图中, 刻画了最小特征值达到极小的唯一图, 并给出了这类图最小特征值的下界.
|
| 关 键 词： | 图 2-点连通 2-边连通 邻接矩阵 最小特征值 |
| 收稿时间： | 2012-05-03 |
The least eigenvalue of graphs whose complements are 2-vertex or 2-edge connected |
| |
| YU Guidong
,
FAN Yizheng.The least eigenvalue of graphs whose complements are 2-vertex or 2-edge connected[J].OR Transactions,2013,17(2):81-88. |
| |
| Authors: | YU Guidong FAN Yizheng |
| |
| Institution: | 1. School of Mathematical Sciences, Anhui University, Hefei 230601, China 2. School of Mathematics and Computation Sciences, Anqing Normal College, Anqing 246011, Anhui, China |
| |
| Abstract: | 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, andpresent a lower bound for the least eigenvalue of such graphs. |
| |
| Keywords: | graph 2-vertex connected 2-edge connected adjacency matrix least eigenvalue |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《运筹学学报》浏览原始摘要信息 |
| 点击此处可从《运筹学学报》下载免费的PDF全文 |
