Sharp upper bounds on the spectral radius of the signless Laplacian matrix of a graph

Maden, A. Dilek (Gungor)Das, Kinkar Ch.Cevik, A. Sinan2020-03-262020-03-2620130096-3003https://dx.doi.org/10.1016/j.amc.2012.11.039https://hdl.handle.net/20.500.12395/29812Let G = (V, E) be a simple connected graph. Denote by D(G) the diagonal matrix of its vertex degrees and by A(G) its adjacency matrix. Then the signless Laplacian matrix of G is Q(G) = D(G) + A(G). In this paper, we obtain some new and improved sharp upper bounds on the spectral radius q(1)(G) of the signless Laplacian matrix of a graph G. (C) 2012 Elsevier Inc. All rights reserved.en10.1016/j.amc.2012.11.039info:eu-repo/semantics/closedAccessGraphSpectral radiusSignless LaplacianBoundsDegreesAverage degree of neighborsSharp upper bounds on the spectral radius of the signless Laplacian matrix of a graphArticle2191050255032Q1WOS:000313825900011Q1