Structure of the path length set in asymmetric trees

DOI10.1142/S0218348X05002969MaRDI QIDQ2937157zbMATH OpenFDO

Authors Chloe Epstein, William Sendewicz, David A. Brown

Publication date 8 January 2015

Published in Fractals (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0218348X05002969

zbMATH Keywords

Cantor setfractalstrees

Mathematics Subject Classification ID

Trees (05C05) Infinite graphs (05C63) Fractals (28A80)

Recommendations

• On the path length of binary trees
• Path length and height in asymmetric binary branching trees
• Left and right pathlengths in random binary trees
• Binary trees, fringe thickness and minimum path length
• A note on the expected path length of trees with known fringe

Cited in

(3)

• Asymmetrization of infinite trees
• Tree asymmetry -- a sensitive and practical measure for binary topological trees
• Path length and height in asymmetric binary branching trees

This page was built for publication: Structure of the path length set in asymmetric trees

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