### Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 247-253 |

Number of pages | 7 |

Journal | Ars Combinatoria |

Volume | 136 |

Publication status | Published - 2018 Jan 1 |

### Keywords

- Degree condition
- K-spider
- Spanning tree
- Spider

### ASJC Scopus subject areas

- Mathematics(all)

### Cite this

*Ars Combinatoria*,

*136*, 247-253.

**A spanning k-spider in a graph.** / Matsubara, Ryota; Matsuda, Haruhide; Matsumura, Hajime.

Research output: Contribution to journal › Article

*Ars Combinatoria*, vol. 136, pp. 247-253.

}

TY - JOUR

T1 - A spanning k-spider in a graph

AU - Matsubara, Ryota

AU - Matsuda, Haruhide

AU - Matsumura, Hajime

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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.

AB - 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.

KW - Degree condition

KW - K-spider

KW - Spanning tree

KW - Spider

UR - http://www.scopus.com/inward/record.url?scp=85046740067&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85046740067&partnerID=8YFLogxK

M3 - Article

VL - 136

SP - 247

EP - 253

JO - Ars Combinatoria

JF - Ars Combinatoria

SN - 0381-7032

ER -