States a sharp spectral radius threshold for the existence of k edge-disjoint 2-connected factors and floor((δ-4k)/2) edge-disjoint spanning trees in graphs with δ ≥ 6 and n ≥ 3δ.
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
-
Spectral radius and edge-disjoint connected factors of graphs
States a sharp spectral radius threshold for the existence of k edge-disjoint 2-connected factors and floor((δ-4k)/2) edge-disjoint spanning trees in graphs with δ ≥ 6 and n ≥ 3δ.