Spectral Condition for Spanning k-Ended Trees in t-Connected Graphs

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).