Explores spectral radius conditions for spanning k-ended trees in t-connected graphs, indicating generalizations of previous findings.
For any integer [Formula: see text], a spanning [Formula: see text]-ended tree is a spanning tree with at most [Formula: see text] leaves. In this paper, we provide tight spectral radius conditions for the existence of a spanning [Formula: see text]-ended tree in [Formula: see text]-connected graphs, which generalizes a result of Ao, Liu and Yuan (2023).
No takes yet. Share an insight, caveat, or question.
Zheng et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: