A graph labeling problem (Q6543069)

A tree with \(n\) vertices is a Leech tree if one can assign to each edge a positive weight such that the sums of weights along the \(\binom{n}{2}\) distinct paths (called the weights of the paths) are exactly the numbers \(1,2,\dots, \binom{n}{2}\). So far, there were only five known examples of Leech trees, all of them of diameter at most 3 and order at most 6.\N\NIt is proved that there is no Leech star of order more than 4 and no Leech tree of diameter 3 with more than 6 vertices. It is also proved that there are at most finitely many Leech trees of diameter 4. This supports the conjecture by \textit{L. A. Székely} [Bull. Inst. Comb. Appl. 44, 37--45 (2005; Zbl 1067.05020)] that there are only finitely many Leech trees.\N\NFinally, it is proved that for any \(k\) if \(d_1,d_2,\dots,d_k\) is the list of all distinct vertex degrees in a Leech tree of order \(n\), then \N\[\Nd^2_1 + d^2_2 +\dots + d^2_k \leq (1/4 + o(1))n^2. \N\]