k-connected even-order graphs with fractional perfect matchings and distance spectral radius bounded above by that of K_k ∨ (kK_1 ∪ K_3 ∪ K_{n-2k-3}) contain perfect matchings when n ≥ 8k+6, except for the extremal graph itself.
Title resolution pending
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
-
Distance spectral radius and perfect matchings in graphs with given fractional property
k-connected even-order graphs with fractional perfect matchings and distance spectral radius bounded above by that of K_k ∨ (kK_1 ∪ K_3 ∪ K_{n-2k-3}) contain perfect matchings when n ≥ 8k+6, except for the extremal graph itself.