2022/10/07 by Wang, Junjie, Zheng, Jiaxin, Chen, Yonglei · 1 citation
#05C50 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2210.03367
A graph G is called fractional [a,b]-covered if for every edge e of G there is a fractional [a,b]-factor with the indicator function h such that h(e)=1. In this paper, we provide tight spectral radius conditions for graphs being fractional [a,b]-covered.