Degree Conditions for Graphs to Have Spanning Trees with Few Branch Vertices and Leaves

Shun ichi Maezawa; Ryota Matsubara; Haruhide Matsuda

doi:10.1007/s00373-018-1998-1

Degree Conditions for Graphs to Have Spanning Trees with Few Branch Vertices and Leaves

Shun ichi Maezawa, Ryota Matsubara, Haruhide Matsuda

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

6 Citations (Scopus)

Abstract

A leaf of a tree is a vertex of degree one and a branch vertex of a tree is a vertex of degree strictly greater than two. This paper shows two degree conditions for graphs to have spanning trees with total bounded number of branch vertices and leaves. Moreover, the sharpness of our results is shown.

Original language	English
Pages (from-to)	231-238
Number of pages	8
Journal	Graphs and Combinatorics
Volume	35
Issue number	1
DOIs	https://doi.org/10.1007/s00373-018-1998-1
Publication status	Published - 2019 Jan 2

Keywords

Branch vertex
Fan-type degree condition
Leaf
Spanning tree

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1007/s00373-018-1998-1

Cite this

@article{d841d8ed64d94f4da71c2dffe4ac97d8,

title = "Degree Conditions for Graphs to Have Spanning Trees with Few Branch Vertices and Leaves",

abstract = "A leaf of a tree is a vertex of degree one and a branch vertex of a tree is a vertex of degree strictly greater than two. This paper shows two degree conditions for graphs to have spanning trees with total bounded number of branch vertices and leaves. Moreover, the sharpness of our results is shown.",

keywords = "Branch vertex, Fan-type degree condition, Leaf, Spanning tree",

author = "Maezawa, {Shun ichi} and Ryota Matsubara and Haruhide Matsuda",

note = "Publisher Copyright: {\textcopyright} 2019, Springer Japan KK, part of Springer Nature.",

year = "2019",

month = jan,

day = "2",

doi = "10.1007/s00373-018-1998-1",

language = "English",

volume = "35",

pages = "231--238",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

number = "1",

}

TY - JOUR

T1 - Degree Conditions for Graphs to Have Spanning Trees with Few Branch Vertices and Leaves

AU - Maezawa, Shun ichi

AU - Matsubara, Ryota

AU - Matsuda, Haruhide

PY - 2019/1/2

Y1 - 2019/1/2

N2 - A leaf of a tree is a vertex of degree one and a branch vertex of a tree is a vertex of degree strictly greater than two. This paper shows two degree conditions for graphs to have spanning trees with total bounded number of branch vertices and leaves. Moreover, the sharpness of our results is shown.

AB - A leaf of a tree is a vertex of degree one and a branch vertex of a tree is a vertex of degree strictly greater than two. This paper shows two degree conditions for graphs to have spanning trees with total bounded number of branch vertices and leaves. Moreover, the sharpness of our results is shown.

KW - Branch vertex

KW - Fan-type degree condition

KW - Leaf

KW - Spanning tree

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

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

U2 - 10.1007/s00373-018-1998-1

DO - 10.1007/s00373-018-1998-1

M3 - Article

AN - SCOPUS:85059627842

SN - 0911-0119

VL - 35

SP - 231

EP - 238

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 1

ER -

Degree Conditions for Graphs to Have Spanning Trees with Few Branch Vertices and Leaves

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this