摘要
图的标号是图论的一个重要分支。定义了2种新图——圈龙图和多毛圈龙图,并证明它们都具有奇优美标号。多毛圈龙图是通过对圈龙图加叶子得来的,证明他们继承了圈龙图的奇优美性,证明方法能够算法化,为圈龙图和多毛圈龙图应用于网络提供了可行的理论保证。
The labeling of Graph is an important branch of the graph theory. Two kinds of new graphs, cyclic-dragon graphs and haired cyclic-dragon graphs, are defined. It is proved that they are odd-graceful. The haired cyclic-dragon graphs is made by adding leaves to cyclic-dragon graphs, so they inherit the odd-graceful property of cyclic-dragon graphs, whose method can algorithm that may be a theoretical guarantee for applying cyclic-dragon graphs and haired cyclic-dragon graphs to network.
出处
《中山大学学报（自然科学版）》
CAS
CSCD
北大核心
2017年第4期9-15,共7页
Acta Scientiarum Naturalium Universitatis Sunyatseni
基金
国家自然科学基金(61163054
61363060
61662066)
关键词
圈龙图
多毛圈龙图
集有序奇优美标号
奇优美标号
叶子
奇优美图
cyclic-dragon graphs
haired cyclic-dragon graphs
set-ordered odd-graceful labeling
oddgraceful labeling
leaf
odd-graceful graph
