Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4649024 | Discrete Mathematics | 2010 | 9 Pages |
Abstract
In this paper, we first give an upper bound for the largest signless Laplacian eigenvalue of a graph and find all the extremal graphs. Secondly, we consider the second-largest signless Laplacian eigenvalue and we characterize the connected graphs whose second-largest signless Laplacian eigenvalue does not exceed 3. Furthermore, we give the signless Laplacian spectral characterization of the latter graphs. In particular, the well-known friendship graph is proved to be determined by the signless Laplacian spectrum.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
JianFeng Wang, Francesco Belardo, QiongXiang Huang, Bojana Borovićanin,