Enumeration of highly balanced trees.

zbMATH Open1324.05026MaRDI QIDQ4982909FDOQ4982909

Authors:

Publication date: 13 April 2015

Recommendations

• Balanced ordered trees
• An asymptotic analysis of unlabeled \(k\)-trees
• Wiener indices of balanced binary trees
• Computational Science – ICCS 2005
• An asymptotic analysis of labeled and unlabeled \(k\)-trees

zbMATH Keywords

enumerationWiener index\(k\)-tree

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Cited In (2)

• Hybrid \(d\)-ary trees and their generalization
• The average path length and link efficiency of a balanced \(k\)-ary tree

This page was built for publication: Enumeration of highly balanced trees.

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