Abstract
Let Aα (G) be the Aα-matrix of a digraph G and lα1,lα2,…,lαn be the eigenvalues of Aα(G). Let ρα(G) be the Aα spectral radius of G and (Formula Presented) be the Aα energy of G by using second spectral moment. Let Gnm 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 Gnm.
Original language | English |
---|---|
Pages (from-to) | 319-333 |
Number of pages | 15 |
Journal | Operators and Matrices |
Volume | 18 |
Issue number | 2 |
DOIs | |
State | Published - 2024 |
Keywords
- A energy
- A spectral radius
- non-strongly connected digraphs