In this paper, we prove that every $n$-vertex connected $K_{1,5}$-free graph $G$ with $σ_4(G)\geq n-1$ contains a spanning tree with at most $5$ leaves and branch vertices in total. Moreover, the degree sum condition "$σ_4(G)\geq n-1$" is best possible.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。