Degree Bounded Spanning Trees

Jun Fujisawa, Hajime Matsumura, Tomoki Yamashita

研究成果: Article

6 引用 (Scopus)

抜粋

In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for every independent set ⊆ of cardinality n(k-1) + c + 2, there exists a vertex set ⊆ of cardinality k such that the degree sum of vertices in X is at least {pipe}V(G){pipe} - c -1. Then G has a spanning tree T with maximum degree at most k + [c/n] and ∑ν∈V(T) max{dT (ν) - k, 0} ≤ c.

元の言語English
ページ(範囲)695-720
ページ数26
ジャーナルGraphs and Combinatorics
26
発行部数5
DOI
出版物ステータスPublished - 2010 9 1
外部発表Yes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

フィンガープリント Degree Bounded Spanning Trees' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用