A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number (Q913810): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3748279 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3726126 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3703700 / rank | |||
Normal rank | |||
Latest revision as of 14:51, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bijection from ordered trees to binary trees that sends the pruning order to the Strahler number |
scientific article |
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
