On the largest tree of given maximum deg
β
Y. Caro; I. Krasikov; Y. Roditty
π
Article
π
1991
π
John Wiley and Sons
π
English
β 258 KB
π 1 views
## Abstract We prove that every connected graph __G__ contains a tree __T__ of maximum degree at most __k__ that either spans __G__ or has order at least __k__Ξ΄(__G__) + 1, where Ξ΄(__G__) is the minimum degree of __G.__ This generalizes and unifies earlier results of Bermond [1] and Win [7]. We als