Sharp $A_α$-Spectral Conditions for Odd $[1,b]$-Factors When $α>1/2$
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918533683740672 |
|---|---|
| author | Huang, Silin |
| author_facet | Huang, Silin |
| contents | We solve, for all sufficiently large even orders, the problem proposed by Chen et al. on sharp $A_α$-spectral conditions for the existence of odd $[1,b]$-factors when $α>1/2$. Chen et al. showed that every connected graph of even order $n$ with no odd $[1,b]$-factor has $A_α$-spectral radius at most $\max_{1\le s\le k}ρ_α(G_s)$, where $G_s=K_s\nabla\left(K_{n-(b+1)s-1}\cup(bs+1)K_1\right)$ and $k=\lfloor(n-2)/(b+1)\rfloor$. Thus the problem reduces to finding the graph with the largest $A_α$-spectral radius among these obstruction graphs. We prove that, for every $α\in(1/2,1)$, $\max_{1\le s\le k}ρ_α(G_s)=\max\{ρ_α(G_1),ρ_α(G_k)\}$. Moreover, for each fixed odd $b\ge 3$ and every even $n\ge N_b=(b+1)\max\{2b+3,14\}+2$, there exists a unique $α=α_\ast(n,b)\in(1/2,1)$ at which $ρ_α(G_1)=ρ_α(G_k)$. Consequently, $G_1$ is the unique extremal graph for $1/2<α<α_\ast(n,b)$, both $G_1$ and $G_k$ are extremal at $α=α_\ast(n,b)$, and $G_k$ is the unique extremal graph for $α_\ast(n,b)<α<1$. This gives the exact $A_α$-spectral threshold, together with the sharp exceptional graphs, for odd $[1,b]$-factors when $α>1/2$ and $n\ge N_b$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2606_00691 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Sharp $A_α$-Spectral Conditions for Odd $[1,b]$-Factors When $α>1/2$ Huang, Silin Combinatorics 05C50 (Primary) 05C70, 05C35 (Secondary) We solve, for all sufficiently large even orders, the problem proposed by Chen et al. on sharp $A_α$-spectral conditions for the existence of odd $[1,b]$-factors when $α>1/2$. Chen et al. showed that every connected graph of even order $n$ with no odd $[1,b]$-factor has $A_α$-spectral radius at most $\max_{1\le s\le k}ρ_α(G_s)$, where $G_s=K_s\nabla\left(K_{n-(b+1)s-1}\cup(bs+1)K_1\right)$ and $k=\lfloor(n-2)/(b+1)\rfloor$. Thus the problem reduces to finding the graph with the largest $A_α$-spectral radius among these obstruction graphs. We prove that, for every $α\in(1/2,1)$, $\max_{1\le s\le k}ρ_α(G_s)=\max\{ρ_α(G_1),ρ_α(G_k)\}$. Moreover, for each fixed odd $b\ge 3$ and every even $n\ge N_b=(b+1)\max\{2b+3,14\}+2$, there exists a unique $α=α_\ast(n,b)\in(1/2,1)$ at which $ρ_α(G_1)=ρ_α(G_k)$. Consequently, $G_1$ is the unique extremal graph for $1/2<α<α_\ast(n,b)$, both $G_1$ and $G_k$ are extremal at $α=α_\ast(n,b)$, and $G_k$ is the unique extremal graph for $α_\ast(n,b)<α<1$. This gives the exact $A_α$-spectral threshold, together with the sharp exceptional graphs, for odd $[1,b]$-factors when $α>1/2$ and $n\ge N_b$. |
| title | Sharp $A_α$-Spectral Conditions for Odd $[1,b]$-Factors When $α>1/2$ |
| topic | Combinatorics 05C50 (Primary) 05C70, 05C35 (Secondary) |
| url | https://arxiv.org/abs/2606.00691 |