A Ramanujan sequence that refines the Cayley formula for trees

DOI10.1023/A:1009809224933zbMath0930.05004OpenAlexW180508456MaRDI QIDQ1288802

Zeng, Jiang

Publication date: 17 May 1999

Published in: The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009809224933

zbMATH Keywords

counting treesCayley's formula

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Special sequences and polynomials (11B83)

Related Items (12)

Trees, forests, and total positivity. I: \(q\)-trees and \(q\)-forests matrices ⋮ Arboretum for a generalisation of Ramanujan polynomials ⋮ A generalization of the Ramanujan polynomials and plane trees ⋮ A remark on the enumeration of rooted labeled trees ⋮ Positivity properties of Jacobi-Stirling numbers and generalized Ramanujan polynomials ⋮ Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees ⋮ Bivariate generating functions for a class of linear recurrences: general structure ⋮ A bijective proof of the Shor recurrence ⋮ A context-free grammar for the Ramanujan-Shor polynomials ⋮ Bijections behind the Ramanujan polynomials ⋮ Derivatives of the tree function ⋮ A REFINEMENT FOR ORDERED LABELED TREES

This page was built for publication: A Ramanujan sequence that refines the Cayley formula for trees