A spider is a rooted tree in which each vertex has degree one or two, except for the root. Moreover, for an integer k ≥ 2, a k-spider is a spider where the root has degree at most k. This paper gives degree conditions for a graph to have a spanning k-spider.
|Number of pages||7|
|Publication status||Published - 2018 Jan 1|
- Degree condition
- Spanning tree
ASJC Scopus subject areas