A spectral condition for a graph having a strong parity factor
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866913536309985280 |
|---|---|
| author | Zhou, Sizhong Zhang, Tao Bian, Qiuxiang |
| author_facet | Zhou, Sizhong Zhang, Tao Bian, Qiuxiang |
| contents | A graph $G$ contains a strong parity factor $F$ if for every subset $X\subseteq V(G)$ with $|X|$ even, $G$ has a spanning subgraph $F$ satisfying $δ(F)\geq1$, $d_F(u)\equiv1$ (mod 2) for any $u\in X$, and $d_F(v)\equiv0$ (mod 2) for any $v\in V(G)\setminus X$. In this paper, we give a spectral radius condition to guarantee that a connected graph contains a strong parity factor. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_13601 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A spectral condition for a graph having a strong parity factor Zhou, Sizhong Zhang, Tao Bian, Qiuxiang Combinatorics 05C50, 05C70 A graph $G$ contains a strong parity factor $F$ if for every subset $X\subseteq V(G)$ with $|X|$ even, $G$ has a spanning subgraph $F$ satisfying $δ(F)\geq1$, $d_F(u)\equiv1$ (mod 2) for any $u\in X$, and $d_F(v)\equiv0$ (mod 2) for any $v\in V(G)\setminus X$. In this paper, we give a spectral radius condition to guarantee that a connected graph contains a strong parity factor. |
| title | A spectral condition for a graph having a strong parity factor |
| topic | Combinatorics 05C50, 05C70 |
| url | https://arxiv.org/abs/2402.13601 |