摘要
在复杂网络研究中,(k,m)-龙图和一致(k,m)-龙图被用来作为复杂网络的模型.主要研究了这类龙图的(k,d)-奇优美标号,并且定义的证明方法很容易转化为算法.
In research on complex networks,（k, m）-dragon graphs and uniformly（k, m）-dragon graphs can be used as models of complex networks in order to describe the clustering phenomenon.（k, d）-odd-graceful labellings of dragon graphs were investigated in this paper and our methods can be easily transferred into algorithms.
出处
《兰州大学学报（自然科学版）》
CAS
CSCD
北大核心
2014年第4期541-545,共5页
Journal of Lanzhou University(Natural Sciences)
基金
Supported by the National Natural Science Foundation of China(61163054,61163037)
Natural Science Foundation of Gansu Province(3ZS051-A25-025)
关键词
龙图
奇优美标号
(k
d)-奇优美标号
dragon graphs
odd-graceful labelling
（k
d）-odd-graceful labelling
