| 二分图的Laplace矩阵的最大特征值 |
| |
| 引用本文： | 殷剑宏. 二分图的Laplace矩阵的最大特征值[J]. 合肥工业大学学报(自然科学版), 2004, 27(8): 952-955 |
| |
| 作者姓名： | 殷剑宏 |
| |
| 作者单位： | 合肥工业大学,计算机与信息学院,安徽,合肥,230009 |
| |
| 摘 要： | 图的Laplace矩阵的谱,在物理、化学和计算机等学科有着广泛应用。但是,求图的Laplace矩阵的谱,是很不容易的。文章通过分析二分图的结构,研究了二分图的Laplace矩阵的特点,利用非负矩阵的经典理论和图论方法,导出了一般二分图的Laplace矩阵的最大特征值的界值。
|
| 关 键 词： | 二分图 Laplace矩阵 最大特征值 界值 |
| 文章编号： | 1003-5060(2004)08-0952-04 |
| 修稿时间： | 2003-09-05 |
The greatest eigenvalue of Laplacian matrices of bipartite graphs |
| |
| YIN Jian-hong. The greatest eigenvalue of Laplacian matrices of bipartite graphs[J]. Journal of Hefei University of Technology(Natural Science), 2004, 27(8): 952-955 |
| |
| Authors: | YIN Jian-hong |
| |
| Abstract: | The spectrum of Laplacian matrices of graphs has numerous applications in physics, chemistry, computer science, and many other sciences,but it is very difficult to compute the spectrum. In this paper,based on the analysis of the structure of bipartite graphs,the characteristic of Laplacian matrices of bipartite graphs is studied,and the new bounds for the greatest eigenvalue of Laplacian matrices of bipartite graphs are given according to the theory of nonnegative matrices. |
| |
| Keywords: | bipartite graph Laplacian matrix the greatest eigenvalue bounds |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
