摘要
根据复杂网络研究的需要,定义(k,m)-龙图和一致(k,m)-龙图作为复杂网络的模型.并且主要对(k,m)-龙图的优美性进行研究,其中证明方法可算法化.
Based on the demand of complex network research, （k,m）-dragon graph and uniform （k, rn）- dragon graph were defined, as models of complex networks. And mainly investigated the gracefulness of （k,m）-dragon graph, in which the method could be made as an algorithm.
出处
《兰州理工大学学报》
CAS
北大核心
2013年第3期133-135,共3页
Journal of Lanzhou University of Technology
基金
甘肃省自然科学基金(3ZS051-A25-025)
关键词
优美标号
优美图
龙图
优美树猜想
graceful labeling
graceful graphs
dragon graphs
graceful tree conjecture
