Enumeration of highly balanced trees.

MaRDI QIDQ4982909zbMATH OpenFDO

Authors

Publication date 13 April 2015

zbMATH Keywords

\(k\)-treeenumerationWiener index

Mathematics Subject Classification ID

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

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

Cited in

(2)

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

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)