| 连通图的拉普拉斯特征值之和的下界 |
| |
| 引用本文： | 袁万莲.连通图的拉普拉斯特征值之和的下界[J].淮北煤炭师范学院学报(自然科学版),2011,32(1). |
| |
| 作者姓名： | 袁万莲 |
| |
| 作者单位： | 滁州学院数学系,安徽,滁州,239000 |
| |
| 摘 要： | 图的拉普拉斯矩阵是指其度对角矩阵和其邻接矩阵之差.设S(G)是图G的前两大的拉普拉斯特征值之和,在所有n阶的连通图中,S(G)的最小值一旦确定,相应的极图也被唯一地刻画.
|
| 关 键 词： | 图 拉普拉斯矩阵 特征值 |
A Lower Bound for the Sum of Laplacian Eigenvalues of Connected Graphs |
| |
| YUAN Wan-lian.A Lower Bound for the Sum of Laplacian Eigenvalues of Connected Graphs[J].Journal of Huaibei Coal Industry Teachers College(Natural Science edition),2011,32(1). |
| |
| Authors: | YUAN Wan-lian |
| |
| Institution: | YUAN Wan-lian(Department of Mathematics,Chuzhou College,239000,Chuzhou,Anhui,China) |
| |
| Abstract: | The Laplacian matrix of a graph is defined to be the difference between the diagonal matrix of vertex degrees and its adjacency matrix.Let S(G) be the sum of the largest two Laplacian eigenvalues of a graph G.Among all connected graphs with n vertices,the unique extremal graph which attains the minimal value of S(G) is determined. |
| |
| Keywords: | graph Laplacian matrix eigenvalue |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
