Spanning Trees whose Stems have a Bounded Number of Branch Vertices
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 condition...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2016-08-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.1885 |
| id |
doaj-0f50363ce1fd4ad5afbbd64c3c80f786 |
|---|---|
| record_format |
Article |
| spelling |
doaj-0f50363ce1fd4ad5afbbd64c3c80f7862021-09-05T17:20:22ZengSciendoDiscussiones Mathematicae Graph Theory2083-58922016-08-0136377377810.7151/dmgt.1885dmgt.1885Spanning Trees whose Stems have a Bounded Number of Branch VerticesYan Zheng0Institute of Applied Mathematics Yangtze University, Jingzhou, Hubei, ChinaLet 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.https://doi.org/10.7151/dmgt.1885spanning treestembranch vertex |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Yan Zheng |
| spellingShingle |
Yan Zheng Spanning Trees whose Stems have a Bounded Number of Branch Vertices Discussiones Mathematicae Graph Theory spanning tree stem branch vertex |
| author_facet |
Yan Zheng |
| author_sort |
Yan Zheng |
| title |
Spanning Trees whose Stems have a Bounded Number of Branch Vertices |
| title_short |
Spanning Trees whose Stems have a Bounded Number of Branch Vertices |
| title_full |
Spanning Trees whose Stems have a Bounded Number of Branch Vertices |
| title_fullStr |
Spanning Trees whose Stems have a Bounded Number of Branch Vertices |
| title_full_unstemmed |
Spanning Trees whose Stems have a Bounded Number of Branch Vertices |
| title_sort |
spanning trees whose stems have a bounded number of branch vertices |
| publisher |
Sciendo |
| series |
Discussiones Mathematicae Graph Theory |
| issn |
2083-5892 |
| publishDate |
2016-08-01 |
| description |
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. |
| topic |
spanning tree stem branch vertex |
| url |
https://doi.org/10.7151/dmgt.1885 |
| work_keys_str_mv |
AT yanzheng spanningtreeswhosestemshaveaboundednumberofbranchvertices |
| _version_ |
1717786475216502784 |