Abstract
This note is a continuation of the articles [6] and [2]. In [1], trees with a given partition α = ( a 1 ; a 2 , …), where a i is the number of vertices (points) of valency (degree) i were enumerated. After the determination of the number of plane trees in [2], the number of planted plane trees with a given partition α was found explicitly in [6]. In the present note, the number of plane trees with a given partition is expressed as a function of the number of planted trees with a given partition. The method, which is not new, consists of an application of the enumeration techniques of Otter [3] and Polya [4]; it was used in [1] and also by Riordan [5].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.