On the spectral radius of a directed graphJaroslaw KwapiszJournal of Graph Theory1996We provide upper estimates on the spectral radius of a directed graph. In particular we prove that the spectral radius is bounded by the maximum of the geometric mean of in-degree and out-degree taken over all vertices.