A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number (Q913810)
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 4148112
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number |
scientific article; zbMATH DE number 4148112 |
Statements
A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number (English)
0 references
1990
0 references
In this beautiful note a bijective proof for the following fact is given: The number of ordered trees with n vertices and pruning order k equals the number of binary trees with n leaves and Strahler number k.
0 references
number of ordered trees
0 references
0.8794905
0 references
0.87217927
0 references
0.83586836
0 references
0.8324125
0 references
0.8317843
0 references
0.83165526
0 references
0.82972777
0 references
0.8284435
0 references
0.8283948
0 references
