scientific article; zbMATH DE number 4134081

zbMATH Open0693.05040MaRDI QIDQ3035320FDOQ3035320

Authors: E. K. Bektaev, Yu. Yu. Prokopchuk 

Publication date: 1987

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 4025461
• scientific article; zbMATH DE number 4008409
• A remark on the enumeration of rooted labeled trees
• Rooted tree statistics from Matula numbers

zbMATH Keywords

number of uniform root treesMöbius inversion

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Cited In (4)

• Note on the number of rooted complete \(N\)-ary trees.
• Title not available (Why is that?)
• HOW TO COUNT TREES?
• Counting rooted trees: the universal law \(t(n)\sim C\rho^{-n} n^{-3/2}\)

This page was built for publication:

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