Abstract
A binary coupling tree on n+1 leaves is a binary tree in which the leaves have distinct labels. The rotation graph G n is defined as the graph of all binary coupling trees on n+1 leaves, with edges connecting trees that can be transformed into each other by a single rotation. In this paper, we study distance properties of the graph G n . Exact results for the diameter of G n for values up to n=10 are obtained. For larger values of n, we prove upper and lower bounds for the diameter, which yield the result that the diameter of G n grows like n lg(n) .
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.
