For b > a, every connected n-vertex graph with minimum degree at least a and spectral radius at least rho(H^{a,b}_n) contains an [a,b]-factor, except H^{a,b}_n itself.
Cioab˘ a, Perfect matchings, eigenvalues and expansion,C
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.SP 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
A note on the spectral radius and $[a,b]$-factor of graphs
For b > a, every connected n-vertex graph with minimum degree at least a and spectral radius at least rho(H^{a,b}_n) contains an [a,b]-factor, except H^{a,b}_n itself.