In this paper, we prove that every n-vertex connected K1,5-free graph G with σ₄(G) ≥ n-1 contains a spanning tree with at most $5$ leaves and branch vertices in total. Moreover, the degree sum condition "σ₄(G) ≥ n-1" is best possible.
No takes yet. Share an insight, caveat, or question.
Ha et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: