The Enumeration of Trees by Height and Diameter

DOI10.1147/RD.45.0473zbMATH Open0097.25201OpenAlexW1999818096MaRDI QIDQ3276708FDOQ3276708

Authors: John Riordan 

Publication date: 1960

Published in: IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1147/rd.45.0473

zbMATH Keywords

combinatorics

Cited In (10)

• A new bijection on rooted forests
• Random-tree Diameter and the Diameter-constrained MST
• A Random Graph With a Subcritical Number of Edges
• An application of graphical enumeration to PA *
• The average height of binary trees and other simple trees
• Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
• The outer-distance of nodes in random trees
• Random trees have height \(O(\sqrt{n})\)
• Title not available (Why is that?)
• The distribution of height and diameter in random non-plane binary trees

This page was built for publication: The Enumeration of Trees by Height and Diameter

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