Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1709629 | Applied Mathematics Letters | 2010 | 5 Pages |
Abstract
In this paper we give two results concerning the signless Laplacian spectra of simple graphs. Firstly, we give a combinatorial expression for the fourth coefficient of the (signless Laplacian) characteristic polynomial of a graph. Secondly, we consider limit points for the (signless Laplacian) eigenvalues and we prove that each non-negative real number is a limit point for (signless Laplacian) eigenvalue of graphs.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Jianfeng Wang, Qiongxiang Huang, Xinhui An, Francesco Belardo,