Graceful labeling for mushroom trees (Q2350272)

A graceful labelling of a graph \(G=(V(G),E(G))\) on \(n\) vertices is a mapping \(f:V(G)@>>>\{0,1,\dots,n\}\) such that the mapping with \(\{x,y\}\mapsto |f(x)-f(y)|\) is injective on the set of edges of \( G\). The authors prove that if \(T\) is a tree of order \(k+1\) and \(S\) is a star with at least \((e^{4/e})^k\) leaves then any graph obtained from the disjoint union of \(T\) and \(S\) by an identification of a vertex \(x\in V(T)\) with the center of \(S\) is a graceful tree.