Sharp bounds for the spectral radius of digraphs (Q1002262)

Let \(G = (V,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. The following sharp bounds on \(\rho(G)\) have been obtained: \[ \min\left\{\sqrt{t_i^+t_j^+}\,:\,(v_i,v_j)\in E\right\}\leq \rho(G)\leq \max\left\{\sqrt{t_i^+t_j^+}\,:\,(v_i,v_j)\in E\right\}\,, \] 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.