A fractional (a,b,m)-covered graph is a generalization of the concept of a fractional [a,b]-covered graph. For any H⊆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∈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.
@article{arxiv.2512.20089,
title = {Spectral radius and size conditions for fractional $(a,b,m)$-covered graphs},
author = {Zengzhao Xu and Ligong Wang and Weige Xi},
journal= {arXiv preprint arXiv:2512.20089},
year = {2025}
}