Spectral radius and size conditions for fractional $(a,b,m)$-covered graphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915692348964864 |
|---|---|
| author | Xu, Zengzhao Wang, Ligong Xi, Weige |
| author_facet | Xu, Zengzhao Wang, Ligong Xi, Weige |
| contents | A fractional $(a,b,m)$-covered graph is a generalization of the concept of a fractional $[a,b]$-covered graph. For any $H \subseteq G$ with edge set $|E(H)| = m$, if there exists a fractional $[a,b]$-factor (the corresponding fractional indicator function is $h$) such that $h(e) = 1$ for any $e \in H$, then the graph $G$ is called a fractional $(a,b,m)$-covered graph. In this paper, we characterize the conditions for a graph to be a fractional $(a,b,m)$-covered graph from the perspectives of spectral radius and size, respectively. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_20089 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Spectral radius and size conditions for fractional $(a,b,m)$-covered graphs Xu, Zengzhao Wang, Ligong Xi, Weige Combinatorics A fractional $(a,b,m)$-covered graph is a generalization of the concept of a fractional $[a,b]$-covered graph. For any $H \subseteq G$ with edge set $|E(H)| = m$, if there exists a fractional $[a,b]$-factor (the corresponding fractional indicator function is $h$) such that $h(e) = 1$ for any $e \in H$, then the graph $G$ is called a fractional $(a,b,m)$-covered graph. In this paper, we characterize the conditions for a graph to be a fractional $(a,b,m)$-covered graph from the perspectives of spectral radius and size, respectively. |
| title | Spectral radius and size conditions for fractional $(a,b,m)$-covered graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2512.20089 |