【摘要】 具有n个顶点且有完美匹配M的树T,若有一个优美标号f,使对T的每条边uv∈M,都有f(u)+f(v)=n-1,则称T是强优美树.证明了具有完美匹配的对虾树都是强优美树,并且给出了一个构造强优美树的简便方法.更多还原

【Abstract】 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.更多还原