A note on the spectral characterization of strongly connected bicyclic digraphs

Let D be a digraph with vertex set V(D) and A be the adjacency matrix of D. In this paper, we characterize the extremal digraphs which achieve the maximum and minimum spectral radius among strongly connected bicyclic digraphs. Furthermore, we show that any strongly connected bicyclic digraph is determined by the spectrum.