Horton-Strahler numbers for binary butterfly trees: exact analysis

DOI10.54550/ECA2026V6S2R11MaRDI QIDQ7304260zbMATH OpenFDO

Authors Helmut Prodinger

Publication date 27 July 2026

Published in Enumerative Combinatorics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.54550/ECA2026V6S2R11

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Trees (05C05)

Cites work

• k-non-crossing trees and edge statistics modulo k
• Horton-Strahler ordering of random binary trees
• scientific article; zbMATH DE number 58317 (Why is no real title available?)
• scientific article; zbMATH DE number 3390782 (Why is no real title available?)
• On a problem of Yekutieli and Mandelbrot about the bifurcation ratio of binary trees
• Philippe Flajolet's early work in combinatorics
• The average number of registers needed to evaluate a binary tree optimally
• The number of registers required for evaluating arithmetic expressions

This page was built for publication: Horton-Strahler numbers for binary butterfly trees: exact analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7304260)