𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Note on the Enumeration and Listing of All Possible Trees in a Connected Linear Graph

✍ Scribed by Horace M. Trent


Book ID
123670766
Publisher
National Academy of Sciences
Year
1954
Tongue
English
Weight
188 KB
Volume
40
Category
Article
ISSN
0027-8424

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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