Consider an order abelian group and a tree on vertices. When is it possible to (bijectively) label by so that along all edges of , the sums 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 and 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.

生成讲解博客的中文版本

生成AI智能校验的中文版本