Sharp bounds of the $A_\alpha$-spectral radii of mixed trees

TL;DR

This paper establishes precise upper and lower bounds for the $A_\alpha$-spectral radius of mixed trees, which include both directed and undirected edges, advancing spectral graph theory for such structures.

Contribution

It provides the first sharp bounds for the $A_\alpha$-spectral radius of mixed trees, extending spectral bounds to trees with both directed and undirected edges.

Findings

Derived sharp upper bounds for the $A_\alpha$-spectral radius.

Established sharp lower bounds for the $A_\alpha$-spectral radius.

Enhanced understanding of spectral properties of mixed trees.

Abstract

A mixed tree is a tree in which both directed arcs and undirected edges may exist. Let $T$ be a mixed tree with $n$ vertices and $m$ arcs, where an undirected edge is counted twice as arcs. Let $A$ be the adjacency matrix of $T$. For $\alpha\in[0,1]$, the matrix $A_\alpha$ of $T$ is defined to be $\alpha D^++(1-\alpha)A$, where $D^+$ is the the diagonal out-degree matrix of $T$. The $A_\alpha$-spectral radius of $T$ is the largest real eigenvalue of $A_\alpha$. We will give a sharp upper bound and a sharp lower bound of the $A_\alpha$-spectral radius of $T$.