| 具有完美匹配的对虾树是强优美树 |
| |
| 引用本文： | 程 辉,刘文娟,姚 兵.具有完美匹配的对虾树是强优美树[J].西南农业大学学报,2012,34(4):089-092. |
| |
| 作者姓名： | 程 辉 刘文娟 姚 兵 |
| |
| 作者单位： | 西北师范大学数学与信息科学学院 |
| |
| 基金项目： | 国家自然科学基金资助项目(61163054,61163037) |
| |
| 摘 要： | 具有n个顶点且有完美匹配M的树T,若有一个优美标号f,使对T的每条边uv∈M,都有f(u)+f(v)=n-1,则称T是强优美树.证明了具有完美匹配的对虾树都是强优美树,并且给出了一个构造强优美树的简便方法.
|
| 关 键 词： | 强优美标号 对虾树 完美匹配 |
L o b s t e r sH a v i n gP e r f e c tM a t c h i n g sA r eS t r o n g l yG r a c e f u l |
| |
| CHENG Hui,LIU Wen-juan,YAO Bing.L o b s t e r sH a v i n gP e r f e c tM a t c h i n g sA r eS t r o n g l yG r a c e f u l[J].Journal of Southwest Agricultural University,2012,34(4):089-092. |
| |
| Authors: | CHENG Hui LIU Wen-juan YAO Bing |
| |
| Institution: | School of Mathematics and Information Science,Northwest Normal University,Lanzhou 730070,Chin |
| |
| 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. |
| |
| Keywords: | strongly graceful labeling lobster perfect matching |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《西南农业大学学报》浏览原始摘要信息 |
| 点击此处可从《西南农业大学学报》下载免费的PDF全文 |
