Abstract
We consider plane trees whose vertices are given labels from the set { 1 , 2 , … , k } in such a way that the sum of the labels along any edge is at most k + 1 ; it turns out that the enumeration of these trees leads to a generalization of the Catalan numbers. We also provide bijections between this class of trees and ( k + 1 ) -ary trees as well as generalized Dyck paths whose step sizes are k (up) and 1 (down) respectively, thereby extending some classic results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
