The paper determines that max ρ_α(G_s) equals max{ρ_α(G_1), ρ_α(G_k)} for α∈(1/2,1), identifies the unique crossing point α*(n,b), and shows G_1 or G_k is the unique extremal obstruction depending on the range of α, for n≥N_b.
The Aα-spectral radius for path-factors in graphs, Discrete Math ematics 2024
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2verdicts
UNVERDICTED 2representative citing papers
Two sufficient degree conditions are given for graphs to be (P≥3,m)-factor deleted and (P≥3,k)-factor critical.
citing papers explorer
-
Two sufficient conditions for graphs to admit path factors
Two sufficient degree conditions are given for graphs to be (P≥3,m)-factor deleted and (P≥3,k)-factor critical.