Abstract
For each tree T on n vertices, a labelling of T is a bijective map from the vertex set of T to the first n positive integers. We consider two maps, which send the labellings of T to labellings of T for all trees T. We show that the transformation monoid generated by these two maps has exactly five elements and we analyse the dynamical behaviours of the action of this monoid on the set of labellings of trees.
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.
