摘要
图的标号主要有(奇)优美标号、和谐标号、幸福标号、魔幻类标号等.圈龙图和多毛圈龙图可以作为计算机网络的模型.证明了圈龙图和多毛圈龙图都具有奇优雅标号,证明方法能够算法化,为网络模型的密码和可区别性研究提供了理论依据和可行的工具.
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.
出处
《大连理工大学学报》
EI
CAS
CSCD
北大核心
2017年第5期531-536,共6页
Journal of Dalian University of Technology
基金
国家自然科学基金资助项目(61163054
61363060
61662066)
关键词
圈龙图
多毛圈龙图
奇优雅标号
叶子
奇优雅图
cyclic-dragon graphs
haired cyclic-dragon graphs
odd-elegant labelling
leaf
odd -elegantgraph