A spanning k-spider in a graph

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)247-253
Number of pages7
JournalArs Combinatoria
Publication statusPublished - 2018 Jan


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

ASJC Scopus subject areas

  • Mathematics(all)


Dive into the research topics of 'A spanning k-spider in a graph'. Together they form a unique fingerprint.

Cite this