Colorings and spectral radius of digraphs

We determine the digraphs that have the minimum and second minimum spectral radius among all strongly connected digraphs with given order and dichromatic number. This solves a problem posed by Lin, Shu, Wu, and Yu.