Matrice de ramification des arbres binaires. (Ramification matrices of binary trees)

DOI10.1016/0166-218X(91)90028-UzbMATH Open0732.05038OpenAlexW1975956517MaRDI QIDQ809098FDOQ809098

J.-G. Penaud

Publication date: 1991

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(91)90028-u

zbMATH Keywords

binary treeramification matricesStrahler number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The average height of binary trees and other simple trees
• On programming of arithmetic operations
• The average number of registers needed to evaluate a binary tree optimally
• The number of registers required for evaluating arithmetic expressions
• On the Order of Random Channel Networks

Cited In (3)

• A note on the Horton-Strahler number for random binary search trees
• Hypermap rewriting: A combinatorial approach
• On the Horton-Strahler number for random tries

   Recommendations

• Enumeration problems of trees 👍 👎
• Horton-Strahler ordering of random binary trees 👍 👎
• Une bijection entre arbres binaires et certaines matrices de Jacobi. (A one-to-one correspondence between binary trees and certain Jacobi matrices) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Matrice de ramification des arbres binaires. (Ramification matrices of binary trees)

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