Let A (G) be the A -matrix of a digraph G and 1 , 2 ,... , n be the eigenvalues ofi be the A energy of G by using second spectral moment.Let G m n be the set of non-strongly connected digraphs with n vertices containing a unique strong component with m vertices and some directed trees hanging on each vertex of the strong component.In this paper, we characterize the digraph which has the maximal A spectral radius and the maximal (or minimal) A energy in G m n .
No takes yet. Share an insight, caveat, or question.
Yang et al. (2024) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: