Strongly Graceful Trees with Perfect Matchings and Diameters not Greater than 7
Xiangqian Zhou · Journal of Henan Normal University · 2012
A Tree T with n vertices and a perfect matching M is strongly graceful if it has a graceful labeling f such that f(u)+f(v)=n-1 hold for all edges uv∈M.This research shows that all trees with diameter not greater than seven and perfect matchings are strongly graceful,and furthermore gives a constructive methods for constructing large scale of strongly graceful trees.