一类图空间的集有序强优美性  

On Set-Ordered Strong Gracefulness of a Graphs Space

作　　者：马飞[1] 苏静[1] 姚兵[1] 

机构地区：[1]西北师范大学数学与统计学院,甘肃兰州730070

出　　处：《武汉大学学报（理学版）》2016年第5期471-476,共6页Journal of Wuhan University:Natural Science Edition

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

摘　　要：讨论了树的集有序强优美性,给出了集有序强优美树的概念,证明了由n棵集有序强优美树的任意排列构成的线性图空间仍具有集有序强优美性;给出了运用两棵同构的强优美树构造集有序强优美树的一种新方法,证明了强优美树与集有序强优美树可以构造强优美树.For studying set-ordered strong gracefulness of trees,we first define the set-ordered strong gracefulness of trees,and then show that the linear graph space constructed by any range of nset-ordered strong graceful trees has the set-ordered strong gracefulness.Secondly,we provide a method by which a set-ordered strongly graceful tree can be constructed any pair of isomorphic strongly graceful trees.At the end of this article the question of whether any strongly graceful tree can be constructed by two or more strongly graceful trees is raised.

关 键 词：强优美标号 集有序强优美标号 完美匹配 

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