Bozkurt, Şerife BurcuGüngör, A. Dilek2020-03-262020-03-262010Bozkurt, Ş. 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.1303-5010https://hdl.handle.net/20.500.12395/24991Let 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).eninfo:eu-repo/semantics/openAccessDigraphSpectral radiusBoundArticle393313318Q3WOS:000283892900003Q4