Spanning Trees whose Stems have a Bounded Number of Branch Vertices
Spanning Trees whose Stems have a Bounded Number of Branch Vertices
复制标题
DOI：
10.7151/dmgt.1885
复制
发表时间：
2016-08
影响因子：
0.7
通讯作者：
Zheng Yan
中科院分区：
文献类型：
--
作者：
Zheng Yan
设T是一棵树，一次顶点和三次以上顶点分别称为叶点和分支点。T的叶集合由Leaf（T）表示。T的子树T − Leaf（T）称为T的茎，记为Stem（T）。本文给出了连通图有一棵主干有界分支顶点数的生成树的两个充分条件，并且这些条件是最佳可能的。
Abstract Let T be a tree, a vertex of degree one and a vertex of degree at least three is called a leaf and a branch vertex, respectively. The set of leaves of T is denoted by Leaf(T). The subtree T − Leaf(T) of T is called the stem of T and denoted by Stem(T). In this paper, we give two sufficient conditions for a connected graph to have a spanning tree whose stem has a bounded number of branch vertices, and these conditions are best possible.