๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Largest Number of Subtrees of Trees with a Given Maximum Degree

โœ Scribed by Kirk, Russell; Wang, Hua

Book ID
118196986
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
190 KB
Volume
22
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the largest tree of given maximum deg
On the largest tree of given maximum degree in a connected graph
โœ 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