Spectral conditions for spanning $k$-trees or $k$-ended-trees of $t$-connected graphs

Jifu Lin, Zenan Du, Xinghui Zhao +1

Let $G$ be a connected graph of order $n$. A spanning $k$-tree of $G$ is a spanning tree with the maximum degree at most $k$, and a spanning $k$-ended-tree of $G$ is a spanning tre…