On the distance spectral radius and the distance energy of graphs
Küçük Resim Yok
Tarih
2011
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
TAYLOR & FRANCIS LTD
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
The D-eigenvalues {mu(1), mu(2), ... , mu(p)} of a connected graph G are the eigenvalues of its distance matrix D. The D-energy of a graph G is the sum of the absolute values of its D-eigenvalues denoted by E(D)(G). In this article, we obtain a lower bound for the largest D-eigenvalue of G and an upper bound for E(D)(G) which improve Indulal's bounds [G. Indulal, Sharp bounds on the distance spectral radius and the distance energy of graphs, Linear Algebra Appl. 430 (2009), pp. 106-113]. In the final section of the article, we give an important remark on the distance regular graphs.
Açıklama
Anahtar Kelimeler
distance spectral radius, distance energy
Kaynak
LINEAR & MULTILINEAR ALGEBRA
WoS Q Değeri
Q2
Scopus Q Değeri
Q2
Cilt
59
Sayı
4
