Trees with the mos subtrees - an algorithmic approach (Q1937356)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6140052
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Trees with the mos subtrees - an algorithmic approach |
scientific article; zbMATH DE number 6140052 |
Statements
Trees with the mos subtrees - an algorithmic approach (English)
0 references
28 February 2013
0 references
In this paper, the authors characterize the trees which maximize the number of subtrees among trees of a given order and degree sequence. The result is useful for finding the trees close to extremal and their numbers of subtrees. Moreover, the authors also proposed some problems/conjectures.
0 references
extremal tree
0 references
number of subtrees
0 references
given order
0 references
given degree sequence
0 references
0.84892297
0 references
0.84892297
0 references
0 references
0.84633195
0 references
0.8435326
0 references
0.8435301
0 references
