Spanning trees with a bounded number of leaves in a claw-free graph

Mikio Kano, Aung Kyaw, Haruhide Matsuda, Kenta Ozeki, Akira Saito, Tomoki Yamashita

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

For a graph H and an integer K ≥ 2, let σ k(H) denote the minimum degree sum of k independent Vertices of H. We prove that if a connected claw-free graph G satisfies σ k+1 (G) ≥ |G| -k, then G has a spanning tree with at most k leaves. We also show that the bound |G| -k is sharp and discuss the maximum degree of the required spanning trees.

Original languageEnglish
Pages (from-to)137-154
Number of pages18
JournalArs Combinatoria
Volume103
Publication statusPublished - 2012 Jan

Keywords

  • Claw-free graphs
  • Degree sum
  • Leaf
  • Spanning tree

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Kano, M., Kyaw, A., Matsuda, H., Ozeki, K., Saito, A., & Yamashita, T. (2012). Spanning trees with a bounded number of leaves in a claw-free graph. Ars Combinatoria, 103, 137-154.

Spanning trees with a bounded number of leaves in a claw-free graph. / Kano, Mikio; Kyaw, Aung; Matsuda, Haruhide; Ozeki, Kenta; Saito, Akira; Yamashita, Tomoki.

In: Ars Combinatoria, Vol. 103, 01.2012, p. 137-154.

Research output: Contribution to journalArticle

Kano, M, Kyaw, A, Matsuda, H, Ozeki, K, Saito, A & Yamashita, T 2012, 'Spanning trees with a bounded number of leaves in a claw-free graph', Ars Combinatoria, vol. 103, pp. 137-154.
Kano M, Kyaw A, Matsuda H, Ozeki K, Saito A, Yamashita T. Spanning trees with a bounded number of leaves in a claw-free graph. Ars Combinatoria. 2012 Jan;103:137-154.
Kano, Mikio ; Kyaw, Aung ; Matsuda, Haruhide ; Ozeki, Kenta ; Saito, Akira ; Yamashita, Tomoki. / Spanning trees with a bounded number of leaves in a claw-free graph. In: Ars Combinatoria. 2012 ; Vol. 103. pp. 137-154.
@article{b5a6beefe67c482b8cbfd2fedc947c68,
title = "Spanning trees with a bounded number of leaves in a claw-free graph",
abstract = "For a graph H and an integer K ≥ 2, let σ k(H) denote the minimum degree sum of k independent Vertices of H. We prove that if a connected claw-free graph G satisfies σ k+1 (G) ≥ |G| -k, then G has a spanning tree with at most k leaves. We also show that the bound |G| -k is sharp and discuss the maximum degree of the required spanning trees.",
keywords = "Claw-free graphs, Degree sum, Leaf, Spanning tree",
author = "Mikio Kano and Aung Kyaw and Haruhide Matsuda and Kenta Ozeki and Akira Saito and Tomoki Yamashita",
year = "2012",
month = "1",
language = "English",
volume = "103",
pages = "137--154",
journal = "Ars Combinatoria",
issn = "0381-7032",
publisher = "Charles Babbage Research Centre",

}

TY - JOUR

T1 - Spanning trees with a bounded number of leaves in a claw-free graph

AU - Kano, Mikio

AU - Kyaw, Aung

AU - Matsuda, Haruhide

AU - Ozeki, Kenta

AU - Saito, Akira

AU - Yamashita, Tomoki

PY - 2012/1

Y1 - 2012/1

N2 - For a graph H and an integer K ≥ 2, let σ k(H) denote the minimum degree sum of k independent Vertices of H. We prove that if a connected claw-free graph G satisfies σ k+1 (G) ≥ |G| -k, then G has a spanning tree with at most k leaves. We also show that the bound |G| -k is sharp and discuss the maximum degree of the required spanning trees.

AB - For a graph H and an integer K ≥ 2, let σ k(H) denote the minimum degree sum of k independent Vertices of H. We prove that if a connected claw-free graph G satisfies σ k+1 (G) ≥ |G| -k, then G has a spanning tree with at most k leaves. We also show that the bound |G| -k is sharp and discuss the maximum degree of the required spanning trees.

KW - Claw-free graphs

KW - Degree sum

KW - Leaf

KW - Spanning tree

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

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

M3 - Article

VL - 103

SP - 137

EP - 154

JO - Ars Combinatoria

JF - Ars Combinatoria

SN - 0381-7032

ER -