The spanning $k$-trees, perfect matchings and spectral radius of graphs

Dandan Fan, Sergey Goryainov, Xueyi Huang +1

A $k$-tree is a spanning tree in which every vertex has degree at most $k$. In this paper, we provide a sufficient condition for the existence of a $k$-tree in a connected graph wi…