Spectral condition for spanning $k$-ended trees in $t$-connected graphs

Abstract

For any integer $k\ge 2$, a spanning $k$-ended tree is a spanning tree with at most $k$ leaves. In this paper, we provide a tight spectral radius condition for the existence of a spanning $k$-ended tree in $t$-connected graphs, which generalizes a result of Ao, Liu and Yuan (2023).

9 pages