On a Spanning k-Tree in which Specified Vertices Have Degree Less Than k
A k-tree is a tree with maximum degree at most k. In this paper, we give a degree sum condition for a graph to have a spanning k-tree in which specified vertices have degree less than k. We denote by σk(G) the minimum value of the degree sum of k independent vertices in a graph G. Let k ≥ 3 and s ≥...
| Glavni autor: | |
|---|---|
| Format: | Članak |
| Jezik: | English |
| Izdano: |
University of Zielona Góra
2015-02-01
|
| Serija: | Discussiones Mathematicae Graph Theory |
| Teme: | |
| Online pristup: | https://doi.org/10.7151/dmgt.1778 |