Improved Bounds for the Spectral Radius of Digraphs
Yükleniyor...
Dosyalar
Tarih
2010
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Hacettepe Univ, Fac Sci
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
Let G = (V, E) be a digraph with n vertices and m, arcs without loops and multi-arcs. The spectral radius rho(G) of G is the largest eigenvalue of its adjacency matrix. In this note, we obtain two sharp upper and lower bounds on rho(G). These bounds improve those obtained by G. H. Xu and C.-Q Xu (Sharp bounds for the spectral radius of digraphs, Linear Algebra Appl. 430, 1607-1612, 2009).
Açıklama
Anahtar Kelimeler
Digraph, Spectral radius, Bound
Kaynak
Hacettepe Journal of Mathematics and Statistics
WoS Q Değeri
Q4
Scopus Q Değeri
Q3
Cilt
39
Sayı
3
Künye
Bozkurt, Ş. B., Güngör, A. D., (2010). Improved Bounds for the Spectral Radius of Digraphs. Hacettepe Journal of Mathematics and Statistics, 39(3), 313-318.
