Abstract
AbstractWe obtain the enumerator by node-valencies of planted plane trees, whose square gives the enumerator of rooted plane trees. We also study the enumeration by number of nodes and black-node-valencies of bichromatic rooted plane trees, encountering a remarkably simple inversion formula. Finally, we remark that these bichromatic trees are in 1–1 correspondence with solutions to the weak lead ballot problem.
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.
