| 谭尚旺,王兴科.图的无号Laplace矩阵的最大特征值[J].数学研究及应用,2009,29(3):381~390 |
| 图的无号Laplace矩阵的最大特征值 |
| On the Largest Eigenvalue of Signless Laplacian Matrix of a Graph |
| 投稿时间：2007-04-12 修订日期：2008-03-08 |
| DOI：10.3770/j.issn:1000-341X.2009.03.001 |
| 中文关键词: 无号Laplace矩阵 特征多项式 最大特征值. |
| 英文关键词:signless Laplacian matrix characteristic polynomial largest eigenvalue. |
| 基金项目:国家自然科学基金(No.10871204); 中国石油大学研究生创新基金(No.S2008-26). |
|
| 摘要点击次数: 3807 |
| 全文下载次数: 3308 |
| 中文摘要: |
| 图的无号Laplace矩阵是它的顶点度对角矩阵与它的邻接矩阵的和.李乔和冯克勤$^{[6]}$给出了图的邻接矩阵最大特征值和特征多项式的一些基本结论.本文把这些结论平移到图的无号拉普拉斯矩阵并且获得了类似的结论. |
| 英文摘要: |
| The signless Laplacian matrix of a graph is the sum of its diagonal matrix of vertex degrees and its adjacency matrix. Li and Feng gave some basic results on the largest eigenvalue and characteristic polynomial of adjacency matrix of a graph in 1979. In this paper, we translate these results into the signless Laplacian matrix of a graph and obtain the similar results. |
| 查看全文 查看/发表评论 下载PDF阅读器 |
