The existence of even factors based on the $A_α$-spectral radius of graphs
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_ | 1866914209162330112 |
|---|---|
| author | Jia, Caili Lu, Yong |
| author_facet | Jia, Caili Lu, Yong |
| contents | An even factor of $G$ is a spanning subgraph $F$ such that every vertex in $F$ has a nonzero even degree. Note that $δ(G)\geq2$ is a trivial necessary condition for a graph to have an even factor, where $δ(G)$ is the minimum degree of $G$. In this paper, for a connected graph $G$ with minimum degree $δ$, we establish a lower bound on the $A_α$-spectral radius of $G$ such that $G$ contains an even factor. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_16932 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The existence of even factors based on the $A_α$-spectral radius of graphs Jia, Caili Lu, Yong Combinatorics An even factor of $G$ is a spanning subgraph $F$ such that every vertex in $F$ has a nonzero even degree. Note that $δ(G)\geq2$ is a trivial necessary condition for a graph to have an even factor, where $δ(G)$ is the minimum degree of $G$. In this paper, for a connected graph $G$ with minimum degree $δ$, we establish a lower bound on the $A_α$-spectral radius of $G$ such that $G$ contains an even factor. |
| title | The existence of even factors based on the $A_α$-spectral radius of graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2512.16932 |