Abstract
We count the number of vertices with given outdegree in plane trees and k-ary trees, and get the following results: the total number of vertices of outdegree i among all plane trees with n edges is $${2n-i-1 \atopwithdelims ()n-1}$$ ; the total number of vertices of degree i among all plane trees with n edges is twice this number; and the total number of vertices of outdegree i among all k-ary trees with n edges is $${k\atopwithdelims ()i}{kn\atopwithdelims ()n-i}$$ . For all these results we give bijective proofs.
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.
