| 图的无号Laplace矩阵的最大特征值 |
| |
| 引用本文： | 谭尚旺,王兴科.图的无号Laplace矩阵的最大特征值[J].数学研究及应用,2009,29(3):381-390. |
| |
| 作者姓名： | 谭尚旺 王兴科 |
| |
| 作者单位： | 中国石油大学数学系, 山东 东营 257061;中国石油大学数学系, 山东 东营 257061 |
| |
| 基金项目： | 国家自然科学基金(No.10871204); 中国石油大学研究生创新基金(No.S2008-26). |
| |
| 摘 要： | 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.
|
| 关 键 词： | Laplacian矩阵 特征值 邻接矩阵 特征多项式 对角矩阵 顶点度 矩阵图 类似 |
| 收稿时间： | 2007/4/12 0:00:00 |
| 修稿时间： | 3/8/2008 12:00:00 AM |
On the Largest Eigenvalue of Signless Laplacian Matrix of a Graph |
| |
| TAN Shang Wang and WANG Xing Ke.On the Largest Eigenvalue of Signless Laplacian Matrix of a Graph[J].Journal of Mathematical Research with Applications,2009,29(3):381-390. |
| |
| Authors: | TAN Shang Wang and WANG Xing Ke |
| |
| Institution: | Department of Applied Mathematics, China University of Petroleum, Shandong 257061, China;Department of Applied Mathematics, China University of Petroleum, Shandong 257061, China |
| |
| Abstract: | 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. |
| |
| Keywords: | signless Laplacian matrix characteristic polynomial largest eigenvalue |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《数学研究及应用》浏览原始摘要信息 |
| 点击此处可从《数学研究及应用》下载免费的PDF全文 |
