Graceful wind chimes (Q2238483)

A graceful labeling of a graph with \(n\) edges is an assignment to each vertex of a unique label between 0 and \(n\), inclusive, satisfying the additional requirement that if each edge is labeled by the absolute value of the difference of its incident vertices, then the set of edge labels is exactly \(\{1,2,\dots,n\}\). In this paper, the authors introduce a class of trees with maximum degree 3, namely wind chimes and show that all wind chimes satisfying certain criteria admit graceful labeling.