New Bounds for the Spectral Radius and Low Energy of the $A_α$-Matrix of Digraphs

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Huang, Silin
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911628079923200
author Huang, Silin
author_facet Huang, Silin
contents The $A_α$-matrix of a digraph $D$ is defined as a linear convex combination $α\operatorname{Deg}(D)+(1-α)A(D)$ of the adjacency matrix $A(D)$ and the diagonal out-degree matrix $\operatorname{Deg}(D)$, where $α\in[0,1]$. The low energy of $A_α(D)$ is defined as the sum of the absolute values of the real parts of the eigenvalues of $A_α(D)$. In this paper, we establish new upper bounds for the spectral radius of the $A_α$-matrix and derive two Koolen--Moulton type upper bounds for its low energy, together with characterizations of the equality cases. Numerical comparisons further show that these bounds can be sharper than existing bounds for certain digraph families. Furthermore, when $α=0$, our results recover several classical bounds, and in particular, the low-energy bounds generalizes the classical Koolen--Moulton bound.
format Preprint
id arxiv_https___arxiv_org_abs_2604_25335
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle New Bounds for the Spectral Radius and Low Energy of the $A_α$-Matrix of Digraphs
Huang, Silin
Combinatorics
05C50 (Primary) 05C20, 15A42 (Secondary)
The $A_α$-matrix of a digraph $D$ is defined as a linear convex combination $α\operatorname{Deg}(D)+(1-α)A(D)$ of the adjacency matrix $A(D)$ and the diagonal out-degree matrix $\operatorname{Deg}(D)$, where $α\in[0,1]$. The low energy of $A_α(D)$ is defined as the sum of the absolute values of the real parts of the eigenvalues of $A_α(D)$. In this paper, we establish new upper bounds for the spectral radius of the $A_α$-matrix and derive two Koolen--Moulton type upper bounds for its low energy, together with characterizations of the equality cases. Numerical comparisons further show that these bounds can be sharper than existing bounds for certain digraph families. Furthermore, when $α=0$, our results recover several classical bounds, and in particular, the low-energy bounds generalizes the classical Koolen--Moulton bound.
title New Bounds for the Spectral Radius and Low Energy of the $A_α$-Matrix of Digraphs
topic Combinatorics
05C50 (Primary) 05C20, 15A42 (Secondary)
url https://arxiv.org/abs/2604.25335