ON THE Aα SPECTRAL RADIUS AND Aα ENERGY OF NON–STRONGLY CONNECTED DIGRAPHS

Xiuwen Yang, Ligong Wang, Weige Xi

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)319-333
Number of pages15
JournalOperators and Matrices
Volume18
Issue number2
DOIs
StatePublished - 2024

Keywords

  • A energy
  • A spectral radius
  • non-strongly connected digraphs

Fingerprint

Dive into the research topics of 'ON THE Aα SPECTRAL RADIUS AND Aα ENERGY OF NON–STRONGLY CONNECTED DIGRAPHS'. Together they form a unique fingerprint.

Cite this