On the spectral radius and energy of non-strongly connected digraphs
arXiv:2109.00409
Abstract
Let be the -matrix of a digraph and be the eigenvalues of . Let be the spectral radius of and be the energy of by using second spectral moment. Let be the set of non-strongly connected digraphs with order , which contain a unique strong component with order and some directed trees which are hung on each vertex of the strong component. In this paper, we characterize the digraph which has the maximal spectral radius and the maximal (minimal) energy in .
14 pages, 6 figures