图的无号Laplace矩阵的最大特征值(英文)

被引：6

作者：

谭尚旺

王兴科

机构：

[1] DepartmentofAppliedMathematics,ChinaUniversityofPetroleum

来源：

数学研究与评论 | 2009年 / 29卷 / 03期

关键词：

D O I：

暂无

中图分类号：

O157.5 [图论];

学科分类号：

070104 ;

摘要：

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.

引用

页码：381 / 390

页数：10