Abstract
In 1975, John Leech asked when can the edges of a tree on n vertices be labeled with positive integers such that the sums along the paths are exactly the integers 1, 2, …, n2. He found five such trees, and no additional trees have been discovered since. In 2011 Leach and Walsh introduced the idea of labeling trees with elements of the group Zk where k=n2+1 and examined the cases for n≤6. In this paper we show that no modular Leech trees of order 7 exist, and we find all modular Leech trees of order 8.
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.
