On the Aα spectral radius and Aα energy of non-strongly connected digraphs
Abstract
Let Aα(G) be the Aα-matrix of a digraph G and λα 1, λα 2, …, λα n be the eigenvalues of Aα(G). Let α(G) be the Aα spectral radius of G and Eα(G)=Σi=1n λα i2 be the Aα energy of G by using second spectral moment. Let Gnm be the set of non-strongly connected digraphs with order n, which contain a unique strong component with order m 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 Aα spectral radius and the maximal (minimal) Aα energy in Gnm.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.