Hu, Zhitao; Wang, Zhiwen; Chen, Xiang’en; Yao, Bing Strongly gracefulness of natural number sequence lobster and its series tree. (Chinese. English summary) Zbl 1313.05319 Math. Pract. Theory 43, No. 24, 192-197 (2013). Summary: Let \(T\) be a tree with \(n\) vertices and a perfect matching \(M\). \(T\) is strongly graceful if it admits a graceful labeling \(f\) such that \(f(u)+f(v)=n-1\) for every edge \(uv\in M\). In this paper, strongly graceful labeling of a natural number sequence lobster and its series tree are discussed. MSC: 05C78 Graph labelling (graceful graphs, bandwidth, etc.) 05C05 Trees Keywords:natural number sequence lobster; graceful labeling; strongly graceful labeling; series tree PDFBibTeX XMLCite \textit{Z. Hu} et al., Math. Pract. Theory 43, No. 24, 192--197 (2013; Zbl 1313.05319)