Güngör, A. DilekDas, Kinkar Ch.2020-03-262020-03-262010Gü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.0800096-30031873-5649https://dx.doi.org/10.1016/j.amc.2010.01.080https://hdl.handle.net/20.500.12395/24992Let 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.en10.1016/j.amc.2010.01.080info:eu-repo/semantics/openAccessDigraphSpectral radiusBoundArticle2163791799Q1WOS:000275739200009Q1