Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4629774 | Applied Mathematics and Computation | 2013 | 8 Pages |
Abstract
Let G=(V,E)G=(V,E) be a simple connected graph. Denote by D(G)D(G) the diagonal matrix of its vertex degrees and by A(G)A(G) its adjacency matrix. Then the signless Laplacian matrix of G is Q(G)=D(G)+A(G)Q(G)=D(G)+A(G). In this paper, we obtain some new and improved sharp upper bounds on the spectral radius q1(G)q1(G) of the signless Laplacian matrix of a graph G.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
A. Dilek (Güngör) Maden, Kinkar Ch. Das, A. Sinan Çevik,