Modular Leech trees of order at most 8 (Q471788)

Summary: \textit{J. Leech} [Am. Math. Mon. 82, 923--925 (1975; Zbl 0322.05103)] 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, \dots, {\binom n2}\). He found five such trees, and no additional trees have been discovered since. \textit{D. Leach} and \textit{M. Walsh} [J. Comb. Math. Comb. Comput. 78, 15--22 (2011; Zbl 1234.05056)] introduced the idea of labeling trees with elements of the group \(\mathbb Z_k\) where \(k = {\binom n2} + 1\) and examined the cases for \(n \leq 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.