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: |
University of Zielona Góra
2016-08-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.1885 |
| _version_ | 1797717995098734592 |
|---|---|
| author | Yan Zheng |
| author_facet | Yan Zheng |
| author_sort | Yan Zheng |
| collection | DOAJ |
| 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. |
| first_indexed | 2024-03-12T08:44:31Z |
| format | Article |
| id | doaj.art-0f50363ce1fd4ad5afbbd64c3c80f786 |
| institution | Directory Open Access Journal |
| issn | 2083-5892 |
| language | English |
| last_indexed | 2024-03-12T08:44:31Z |
| publishDate | 2016-08-01 |
| publisher | University of Zielona Góra |
| record_format | Article |
| series | Discussiones Mathematicae Graph Theory |
| spelling | doaj.art-0f50363ce1fd4ad5afbbd64c3c80f7862023-09-02T16:29:59ZengUniversity of Zielona GóraDiscussiones 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 |
| spellingShingle | Yan Zheng Spanning Trees whose Stems have a Bounded Number of Branch Vertices Discussiones Mathematicae Graph Theory spanning tree stem branch vertex |
| title | 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_short | Spanning Trees whose Stems have a Bounded Number of Branch Vertices |
| title_sort | spanning trees whose stems have a bounded number of branch vertices |
| topic | spanning tree stem branch vertex |
| url | https://doi.org/10.7151/dmgt.1885 |
| work_keys_str_mv | AT yanzheng spanningtreeswhosestemshaveaboundednumberofbranchvertices |