Consider an order n abelian group G and a tree T on n vertices. When is it possible to (bijectively) label V (T) by G so that along all edges xy of T, the sums x+y are distinct? This problem can be traced back to the work of Graham and Sloane on the harmonious labelling conjecture, and has been studied extensively since its introduction in 1980. We give a precise characterisation that holds for all bounded degree trees. In particular, our characterisation implies that if G=Z/nZ and T is a bounded degree tree, the desired labelling exists. This confirms a conjecture of Graham and Sloane from 1980, and another conjecture of Chang, Hsu, and Rogers from 1987, for bounded degree trees. Our results also have further applications for the study of graph coverings.
Müyesser et al. (Fri,) studied this question.