Loading...
Please wait, while we are loading the content...
Spanning trees with at most 4 leaves in K 1 , 5-free graphs
| Content Provider | Semantic Scholar |
|---|---|
| Author | Chen, Yuan Hanh, Dang Dinh |
| Copyright Year | 2018 |
| Abstract | In 2009, Kyaw proved that every n-vertex connected K1,4-free graph G with σ4(G) ≥ n− 1 contains a spanning tree with at most 3 leaves. In this paper, we prove an analogue of Kyaw’s result for connected K1,5-free graphs. We show that every n-vertex connected K1,5-free graph G with σ5(G) ≥ n − 1 contains a spanning tree with at most 4 leaves. Moreover, the degree sum condition “σ5(G) ≥ n− 1” is best possible. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://export.arxiv.org/pdf/1804.09332 |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Analog File spanning Graph - visual representation Plant Leaves Random graph Spanning tree Trees (plant) Vertex |
| Content Type | Text |
| Resource Type | Article |