Abstract
We study the class of treesTon the set {1, 2, …, n} such that for any 1⩽i<j<k⩽nthe pairs {i, j} and {j, k} cannot both be edges inT. We derive a formula for the number of such trees. We also give a functional equation and a differential equation for the generating function. We mention some additional combinatorial interpretations of these numbers.
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.
