Sharp upper bounds on the spectral radius of the signless Laplacian matrix of a graph
Küçük Resim Yok
Tarih
2013
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
ELSEVIER SCIENCE INC
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
Let 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.
Açıklama
Anahtar Kelimeler
Graph, Spectral radius, Signless Laplacian, Bounds, Degrees, Average degree of neighbors
Kaynak
APPLIED MATHEMATICS AND COMPUTATION
WoS Q Değeri
Q1
Scopus Q Değeri
Q1
Cilt
219
Sayı
10
