Sharp bounds for the spectral radius of digraphs

Let $G=(V\text{,}E)$ 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, the following sharp bounds on $\rho (G)$ have been obtained.$\min \{\sqrt{t_i^{+}{t}_j^{+}}:(v_i\text{,}{v}_j)\in E\}?\rho (G)?\max \{\sqrt{t_i^{+}{t}_j^{+}}:(v_i\text{,}{v}_j)\in E\}$where G is strongly connected and $t_i^{+}$ is the average 2-outdegree of vertex $v_i$. Moreover, each equality holds if and only if G is average 2-outdegree regular or average 2-outdegree semiregular.