On the number of deepest nodes in ordered trees

DOI10.1016/0012-365X(90)90064-OzbMath0701.05017MaRDI QIDQ913809

Rainer Kemp

Publication date: 1990

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

zbMATH Keywords

combinatorial identitynumber of n-node ordered trees

Mathematics Subject Classification ID

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

Related Items

The scientific works of Rainer Kemp (1949--2004), A one-to-one correspondence between two classes of ordered trees, Return statistics of simple random walks, The average height of thed-th highest leaf of a planted plane tree, Deepest nodes in marked ordered trees

Cites Work

• Two short proofs of Kemp's identity for rooted plane trees
• The average height of r-tuply rooted planted plane trees
• On the average depth of a prefix of the Dycklanguage \(D_ 1\).
• A note on a result of R. Kemp on r-tuply rooted planted plane trees
• On the average oscillation of a stack
• Asymptotic Methods in Enumeration
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item