A spanning k-spider in a graph

Ryota Matsubara; Haruhide Matsuda; Hajime Matsumura

A spanning k-spider in a graph

Ryota Matsubara, Haruhide Matsuda, Hajime Matsumura

Research output: Contribution to journal › Article › peer-review

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

Keywords

Degree condition
K-spider
Spanning tree
Spider

ASJC Scopus subject areas

Mathematics(all)

Cite this

@article{9dd7c9292ade438590f6a78dbf9ae31a,

title = "A spanning k-spider in a graph",

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.",

keywords = "Degree condition, K-spider, Spanning tree, Spider",

author = "Ryota Matsubara and Haruhide Matsuda and Hajime Matsumura",

year = "2018",

month = jan,

language = "English",

volume = "136",

pages = "247--253",

journal = "Ars Combinatoria",

issn = "0381-7032",

publisher = "Charles Babbage Research Centre",

}

TY - JOUR

T1 - A spanning k-spider in a graph

AU - Matsubara, Ryota

AU - Matsuda, Haruhide

AU - Matsumura, Hajime

PY - 2018/1

Y1 - 2018/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

AN - SCOPUS:85046740067

SN - 0381-7032

VL - 136

SP - 247

EP - 253

JO - Ars Combinatoria

JF - Ars Combinatoria

ER -

A spanning k-spider in a graph

Abstract

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this