具有完美匹配的对虾树是强优美树  

Lobsters Having Perfect Matchings Are Strongly Graceful

作　　者：程辉[1] 刘文娟[1] 姚兵[1] 

机构地区：[1]西北师范大学数学与信息科学学院,兰州730070

出　　处：《西南大学学报（自然科学版）》2012年第4期89-92,共4页Journal of Southwest University(Natural Science Edition)

基　　金：国家自然科学基金资助项目(61163054;61163037)

摘　　要：具有n个顶点且有完美匹配M的树T,若有一个优美标号f,使对T的每条边uv∈M,都有f(u)+f(v)=n-1,则称T是强优美树.证明了具有完美匹配的对虾树都是强优美树,并且给出了一个构造强优美树的简便方法.A tree T with n vertices and a perfect matching M is strongly graceful if T admits a graceful la- beling f such that f（u）＋f（v）=n-1 for every edge uvE M. The strong gracefulness of all lobsters having perfect matchings are proved, and a quick method for building up larger strongly graceful trees from smal- ler ones is introduced.

关 键 词：强优美标号 对虾树 完美匹配 

分 类 号：O157.5[理学—数学]