| 关于圈龙图的奇优雅性 |
| |
| 引用本文： | 孙慧,姚兵. 关于圈龙图的奇优雅性[J]. 大连理工大学学报, 2017, 57(5): 531-536 |
| |
| 作者姓名： | 孙慧 姚兵 |
| |
| 基金项目： | 国家自然科学基金资助项目(611630546136306061662066). |
| |
| 摘 要： | 图的标号主要有(奇)优美标号、和谐标号、幸福标号、魔幻类标号等.圈龙图和多毛圈龙图可以作为计算机网络的模型.证明了圈龙图和多毛圈龙图都具有奇优雅标号,证明方法能够算法化,为网络模型的密码和可区别性研究提供了理论依据和可行的工具.
|
| 关 键 词： | 圈龙图；多毛圈龙图；奇优雅标号；叶子；奇优雅图 |
On odd-elegant quality of cyclic-dragon graphs |
| |
| SUN Hui,YAO Bing. On odd-elegant quality of cyclic-dragon graphs[J]. Journal of Dalian University of Technology, 2017, 57(5): 531-536 |
| |
| Authors: | SUN Hui YAO Bing |
| |
| Abstract: | Graph labellings mainly include (odd-)graceful labellings, harmonious labellings, felicitous labellings, magic types of labellings. As known, (haired) cyclic-dragon graphs can be used to computer network models. The odd-elegant quality of (haired) cyclic-dragon graphs is proved, and the proof methods can be easily translated into algorithm. The work provides theoretical basis and feasible tools for cryptology and distinguishing research in networks. |
| |
| Keywords: | cyclic-dragon graphs haired cyclic-dragon graphs odd-elegant labelling leaf odd-elegant graph |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《大连理工大学学报》浏览原始摘要信息 |
|
点击此处可从《大连理工大学学报》下载全文 |
|
