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 journalArticle

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 languageEnglish
Pages (from-to)231-238
Number of pages8
JournalGraphs and Combinatorics
Volume35
Issue number1
DOIs
Publication statusPublished - 2019 Jan 2

Keywords

  • Branch vertex
  • Fan-type degree condition
  • Leaf
  • Spanning tree

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this

Degree Conditions for Graphs to Have Spanning Trees with Few Branch Vertices and Leaves. / Maezawa, Shun ichi; Matsubara, Ryota; Matsuda, Haruhide.

In: Graphs and Combinatorics, Vol. 35, No. 1, 02.01.2019, p. 231-238.

Research output: Contribution to journalArticle

@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",
year = "2019",
month = "1",
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

VL - 35

SP - 231

EP - 238

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 1

ER -