Spectral condition for $k$-factor-criticality in $t$-connected graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914014803525632 |
|---|---|
| author | Ma, Tingyan van Dam, Edwin R. Wang, Ligong |
| author_facet | Ma, Tingyan van Dam, Edwin R. Wang, Ligong |
| contents | A graph $G$ is called $k$-factor-critical if $G-S$ has a perfect matching for every $S\subseteq G$ with $|S|=k$. A connected graph $G$ is called $t$-connected if it has more than $t$ vertices and remains connected whenever fewer than $t$ vertices are removed. We give a condition on the number of edges and a condition on the spectral radius for $k$-factor-criticality in $t$-connected graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_22951 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Spectral condition for $k$-factor-criticality in $t$-connected graphs Ma, Tingyan van Dam, Edwin R. Wang, Ligong Combinatorics A graph $G$ is called $k$-factor-critical if $G-S$ has a perfect matching for every $S\subseteq G$ with $|S|=k$. A connected graph $G$ is called $t$-connected if it has more than $t$ vertices and remains connected whenever fewer than $t$ vertices are removed. We give a condition on the number of edges and a condition on the spectral radius for $k$-factor-criticality in $t$-connected graphs. |
| title | Spectral condition for $k$-factor-criticality in $t$-connected graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2503.22951 |