Spectral conditions for factor-criticality of graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911745461714944 |
|---|---|
| author | Cai, Jin Zhou, Bo |
| author_facet | Cai, Jin Zhou, Bo |
| contents | A graph $G$ is $k$-factor-critical if $G-S$ has a perfect matching for any $k$-subset $S$ of the vertex set of $G$. In this paper, we investigate the factor-criticality of graphs with fixed minimum degree and provide sufficient conditions for such graphs to be $k$-factor-critical in terms of spectral radius and signless Laplacian spectral radius. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_01030 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Spectral conditions for factor-criticality of graphs Cai, Jin Zhou, Bo Combinatorics A graph $G$ is $k$-factor-critical if $G-S$ has a perfect matching for any $k$-subset $S$ of the vertex set of $G$. In this paper, we investigate the factor-criticality of graphs with fixed minimum degree and provide sufficient conditions for such graphs to be $k$-factor-critical in terms of spectral radius and signless Laplacian spectral radius. |
| title | Spectral conditions for factor-criticality of graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2401.01030 |