Degree sums and spanning brooms of a graph
Degree sums and spanning brooms of a graph
复制标题
DOI：
10.1016/j.disc.2022.112966
复制
发表时间：
2022-09
期刊：
影响因子：
--
通讯作者：
Yueyu Wu;Yunqing Zhang;Yaojun Chen
中科院分区：
文献类型：
--
作者：
Yueyu Wu;Yunqing Zhang;Yaojun Chen
扫帚是通过用星星的中心标识路径的端点而获得的树。设G是阶数n≥ 3的连通图. Chen等人[2]证明了如果任意三个两两不相邻的顶点的度和至少为n-2，则G包含一个生成扫帚。本文对n> 50的情形证实了这个猜想。
A broom is a tree obtained by identifying an endpoint of a path with the center of a star. Let G be a connected graph of order n≥ 3. Chen et al.[2] conjectured that if the degree sum is at least n− 2 for any three pairwise nonadjacent vertices, then G contains a spanning broom. In this paper, we confirm the conjecture for n> 50.