Tight spectral radius conditions guarantee perfect k-matchings in t-connected graphs, including those with fractional perfect matchings.
Zhang, Spectral conditions for connectivity, toughness and perfectk-matchings of regular graphs, Bull
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Spectral radius and perfect k-matchings in t-connected graphs
Tight spectral radius conditions guarantee perfect k-matchings in t-connected graphs, including those with fractional perfect matchings.