Lobsters Having Perfect Matchings Are Strongly Graceful
Yao Bing · Journal of Southwest University · 2012
A tree T with n vertices and a perfect matching M is strongly graceful if T admits a graceful labeling f such that f(u)+f(v)=n-1 for every edge uv∈M.The strong gracefulness of all lobsters having perfect matchings are proved,and a quick method for building up larger strongly graceful trees from smaller ones is introduced.