Please use this identifier to cite or link to this item:
Title: On the two largest Q-eigenvalues of graphs
Authors: Wang, Jianfeng
Belardo, Francesco
Huang Q.
Borovićanin, Bojana
Issue Date: 2010
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.
Type: article
DOI: 10.1016/j.disc.2010.06.030
ISSN: 0012-365X
SCOPUS: 2-s2.0-79952988936
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)




Files in This Item:
File Description SizeFormat 
  Restricted Access
29.86 kBAdobe PDFThumbnail

Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.