Ordering digraphs with maximum outdegrees by their $A_α$ spectral radius
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912198079545344 |
|---|---|
| author | Xu, Zengzhao Xi, Weige Wang, Ligong |
| author_facet | Xu, Zengzhao Xi, Weige Wang, Ligong |
| contents | Let $G$ be a strongly connected digraph with $n$ vertices and $m$ arcs. For any real $α\in[0,1]$, the $A_α$ matrix of a digraph $G$ is defined as $$A_α(G)=αD(G)+(1-α)A(G),$$ where $A(G)$ is the adjacency matrix of $G$ and $D(G)$ is the outdegrees diagonal matrix of $G$. The eigenvalue of $A_α(G)$ with the largest modulus is called the $A_α$ spectral radius of $G$, denoted by $λ_α(G)$. In this paper, we first obtain an upper bound on $λ_α(G)$ for $α\in[\frac{1}{2},1)$. Employing this upper bound, we prove that for two strongly connected digraphs $G_1$ and $G_2$ with $n\ge4$ vertices and $m$ arcs, and $α\in [\frac{1}{\sqrt{2}},1)$, if the maximum outdegree $Δ^+(G_1)\ge 2α(1-α)(m-n+1)+2α$ and $Δ^+(G_1)>Δ^+(G_2)$, then $λ_α(G_1)>λ_α(G_2)$. Moreover, We also give another upper bound on $λ_α(G)$ for $α\in[\frac{1}{2},1)$. Employing this upper bound, we prove that for two strongly connected digraphs with $m$ arcs, and $α\in[\frac{1}{2},1)$, if the maximum outdegree $Δ^+(G_1)>\frac{2m}{3}+1$ and $Δ^+(G_1)>Δ^+(G_2)$, then $λ_α(G_1)+\frac{1}{4}>λ_α(G_2)$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_12412 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Ordering digraphs with maximum outdegrees by their $A_α$ spectral radius Xu, Zengzhao Xi, Weige Wang, Ligong Combinatorics Let $G$ be a strongly connected digraph with $n$ vertices and $m$ arcs. For any real $α\in[0,1]$, the $A_α$ matrix of a digraph $G$ is defined as $$A_α(G)=αD(G)+(1-α)A(G),$$ where $A(G)$ is the adjacency matrix of $G$ and $D(G)$ is the outdegrees diagonal matrix of $G$. The eigenvalue of $A_α(G)$ with the largest modulus is called the $A_α$ spectral radius of $G$, denoted by $λ_α(G)$. In this paper, we first obtain an upper bound on $λ_α(G)$ for $α\in[\frac{1}{2},1)$. Employing this upper bound, we prove that for two strongly connected digraphs $G_1$ and $G_2$ with $n\ge4$ vertices and $m$ arcs, and $α\in [\frac{1}{\sqrt{2}},1)$, if the maximum outdegree $Δ^+(G_1)\ge 2α(1-α)(m-n+1)+2α$ and $Δ^+(G_1)>Δ^+(G_2)$, then $λ_α(G_1)>λ_α(G_2)$. Moreover, We also give another upper bound on $λ_α(G)$ for $α\in[\frac{1}{2},1)$. Employing this upper bound, we prove that for two strongly connected digraphs with $m$ arcs, and $α\in[\frac{1}{2},1)$, if the maximum outdegree $Δ^+(G_1)>\frac{2m}{3}+1$ and $Δ^+(G_1)>Δ^+(G_2)$, then $λ_α(G_1)+\frac{1}{4}>λ_α(G_2)$. |
| title | Ordering digraphs with maximum outdegrees by their $A_α$ spectral radius |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2501.12412 |