Spectral radius and k-factor-critical graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914654889967616 |
|---|---|
| author | Zhou, Sizhong Sun, Zhiren Zhang, Yuli |
| author_facet | Zhou, Sizhong Sun, Zhiren Zhang, Yuli |
| contents | For a nonnegative integer $k$, a graph $G$ is said to be $k$-factor-critical if $G-Q$ admits a perfect matching for any $Q\subseteq V(G)$ with $|Q|=k$. In this article, we prove spectral radius conditions for the existence of $k$-factor-critical graphs. Our result generalises one previous result on perfect matchings of graphs. Furthermore, we claim that the bounds on spectral radius in Theorem 3.1 are sharp. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2306_16849 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Spectral radius and k-factor-critical graphs Zhou, Sizhong Sun, Zhiren Zhang, Yuli Combinatorics 05C50, 05C70 For a nonnegative integer $k$, a graph $G$ is said to be $k$-factor-critical if $G-Q$ admits a perfect matching for any $Q\subseteq V(G)$ with $|Q|=k$. In this article, we prove spectral radius conditions for the existence of $k$-factor-critical graphs. Our result generalises one previous result on perfect matchings of graphs. Furthermore, we claim that the bounds on spectral radius in Theorem 3.1 are sharp. |
| title | Spectral radius and k-factor-critical graphs |
| topic | Combinatorics 05C50, 05C70 |
| url | https://arxiv.org/abs/2306.16849 |