Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2401.12984 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916103690649600 |
|---|---|
| author | Cai, Jin Zhou, Bo |
| author_facet | Cai, Jin Zhou, Bo |
| contents | A factor of a graph is a spanning subgraph. Spectral sufficient conditions are provided via spectral radius and signless Laplacian spectral radius for graphs with (i) a matching of given size (particularly, $1$-factor) containing any given edge, and (ii) a star factor with a component isomorphic to stars of order two or three containing any given edge, respectively. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_12984 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Spectral conditions for graphs in which every edge belongs to a factor Cai, Jin Zhou, Bo Combinatorics A factor of a graph is a spanning subgraph. Spectral sufficient conditions are provided via spectral radius and signless Laplacian spectral radius for graphs with (i) a matching of given size (particularly, $1$-factor) containing any given edge, and (ii) a star factor with a component isomorphic to stars of order two or three containing any given edge, respectively. |
| title | Spectral conditions for graphs in which every edge belongs to a factor |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2401.12984 |