Sufficient conditions on size and adjacency spectral radius guarantee that every connected graph of order n with minimum degree δ has a {P3,P4,P5}-factor.
Lv, A degree condition for graphs being fractional (a,b,k)-critical covered, Filomat37(10) (2023) 3315–3320
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
-
Graphs with $\{P_3,P_4,P_5\}$-factors in terms of size and spectral radius
Sufficient conditions on size and adjacency spectral radius guarantee that every connected graph of order n with minimum degree δ has a {P3,P4,P5}-factor.