A generalized enumeration of labeled trees and reverse Prüfer algorithm

DOI10.1016/j.jcta.2007.01.010zbMath1127.05053arXivmath/0601009OpenAlexW2021763682MaRDI QIDQ2384578

Heesung Shin, Seung-Hyun Seo

Publication date: 10 October 2007

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0601009

zbMATH Keywords

treePrüfer code

Mathematics Subject Classification ID

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

Related Items (9)

Bijections on rooted trees with fixed size of maximal decreasing subtrees ⋮ The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses ⋮ Unit interval parking functions and the \(r\)-Fubini numbers ⋮ Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees ⋮ An insertion algorithm and leaders of rooted trees ⋮ Disposition polynomials and plane trees ⋮ Rooted forests that avoid sets of permutations ⋮ A REFINED ENUMERATION OF p-ARY LABELED TREES ⋮ A REFINEMENT FOR ORDERED LABELED TREES

Cites Work

• A refinement of Cayley's formula for trees
• A combinatorial proof of {P}ostnikov's identity and a generalized enumeration of labeled trees

This page was built for publication: A generalized enumeration of labeled trees and reverse Prüfer algorithm