论文标题
跨越$ 5 $叶子和分支顶点的最多$ k_ {1,5} $ - 免费图形
Spanning trees with at most $5$ leaves and branch vertices in total of $K_{1,5}$-free graphs
论文作者
论文摘要
在本文中，我们证明，每一个$ n $ vertex connected $ k_ {1,5} $ - 免费图$ g $，带有$σ_4（g）\ geq n-1 $包含一棵带有$ 5 $叶子和分支的分支机构。此外，最好的总和条件“ $σ_4（g）\ geq n-1 $”是最好的。
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.
