A Generalized Enumeration of Labeled Trees and Reverse Prüfer Algorithm

Details A Generalized Enumeration of Labeled Trees and Reverse Prüfer Algorithm A Generalized Enumeration of Labeled Trees and Reverse Prüfer Algorithm

2005-12-31

arxiv.org/abs/math/0601009v1

Mathematics

Combinatorics

5 pages, 3 figures

Scientific paper

A {\em leader} of a tree $T$ on $[n]$ is a vertex which has no smaller descendants in $T$. Gessel and Seo showed $$\sum_{T \in \mathcal{T}_n}u^\text{(# of leaders in $T$)} c^\text{(degree of 1 in $T$)}=u P_{n-1}(1,u,cu),$$ which is a generalization of Cayley formula, where $\mathcal{T}_n$ is the set of trees on $[n]$ and $$P_n(a,b,c)=c\prod_{i=1}^{n-1}(ia+(n-i)b+c).$$ Using a variation of Pr\"ufer code which is called a {\em RP-code}, we give a simple bijective proof of Gessel and Seo's formula.

Affiliated with

Also associated with

No associations

Rating

A Generalized Enumeration of Labeled Trees and Reverse Prüfer Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Generalized Enumeration of Labeled Trees and Reverse Prüfer Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Generalized Enumeration of Labeled Trees and Reverse Prüfer Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-398902