Please use this identifier to cite or link to this item:
|Title:||On the two largest Q-eigenvalues of graphs|
|Authors:||Wang, Jianfeng |
|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 secondlargest 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. © 2010 Elsevier B.V. All rights reserved.|
|Appears in Collections:||Faculty of Science, Kragujevac|
Files in This Item:
|29.86 kB||Adobe PDF|
Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.