Spectral radius and spanning trees of graphs

Guoyan Ao, Ruifang Liu, Jinjiang Yuan

For integer $k\ge 2,$ a spanning $k$-ended-tree is a spanning tree with at most $k$ leaves. Motivated by the closure theorem of Broersma and Tuinstra [Independence trees and Hamilt…