Improved Upper and Lower Bounds for the Spectral Radius of Digraphs
Yükleniyor...
Dosyalar
Tarih
2010
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Elsevier Science Inc
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
Let G be a digraph with n vertices and m arcs without loops and multiarcs. The spectral radius rho(G) of G is the largest eigenvalue of its adjacency matrix. In this paper, sharp upper and lower bounds on rho(G) are given. We show that some known bounds can be obtained from our bounds.
Açıklama
Anahtar Kelimeler
Digraph, Spectral radius, Bound
Kaynak
Applied Mathematics and Computation
WoS Q Değeri
Q1
Scopus Q Değeri
Q1
Cilt
216
Sayı
3
Künye
Güngör, A. D., Das, K. C., (2010). Improved Upper and Lower Bounds for the Spectral Radius of Digraphs. Applied Mathematics and Computation, (216), 791-799. Doi: 10.1016/j.amc.2010.01.080
