| 具有匹配对网络模型的优美性 |
| |
| 引用本文： | 张家娟,姚兵,陈祥恩. 具有匹配对网络模型的优美性[J]. 数学的实践与认识, 2014, 0(1) |
| |
| 作者姓名： | 张家娟 姚兵 陈祥恩 |
| |
| 作者单位： | 西北师范大学数学与统计学院; |
| |
| 基金项目： | 国家自然科学基金(61163054,61163037) |
| |
| 摘 要： | 在当今网络研究中,人们需要将某些特殊的图分解为指定的结构.优美图可以被运用到图分解中.得到一些构造优美图的可算法化的方法,并构造较为复杂的优美图.
|
| 关 键 词： | 树 优美标号 优美图 |
Gracefulness of Network Models with Matching Pairs |
| |
| Abstract: | It has been known that the decomposition of graphs is very important in research of current networks.Moreover,graceful graphs have been used to decompose some graphs.We discover some methods that can be used to construct larger scale of graceful graphs from smaller graceful graphs,and furthermore the methods can be transformed into algorithms. |
| |
| Keywords: | tree graceful labelling graceful graph |
| 本文献已被 CNKI 等数据库收录！ |
|
