Unbalanced subtrees in binary rooted ordered and un-ordered trees
@article{Disanto2012UnbalancedSI, title={Unbalanced subtrees in binary rooted ordered and un-ordered trees}, author={Filippo Disanto}, journal={arXiv: Combinatorics}, year={2012} }
Binary rooted trees, both in the ordered and in the un-ordered case, are well studied structures in the field of combinatorics. The aim of this work is to study particular patterns in these classes of trees. We consider completely unbalanced subtrees, where unbalancing is measured according to the so-called Colless's index. The size of the biggest unbalanced subtree becomes then a new parameter with respect to which we find several enumerations.
One Citation
Non-Contiguous Pattern Avoidance in Binary Trees
- Mathematics, Computer Science
- Electron. J. Comb.
- 2012
- 22
- PDF
References
SHOWING 1-6 OF 6 REFERENCES
Non-Contiguous Pattern Avoidance in Binary Trees
- Mathematics, Computer Science
- Electron. J. Comb.
- 2012
- 22
- PDF
The Mean and Variance of the Numbers of r-Pronged Nodes and r-Caterpillars in Yule-Generated Genealogical Trees
- Mathematics
- 2006
- 60
- PDF
SEARCHING FOR EVOLUTIONARY PATTERNS IN THE SHAPE OF A PHYLOGENETIC TREE
- Biology, Medicine
- Evolution; international journal of organic evolution
- 1993
- 221