期刊文献+

探讨几类具有完全图核心的网络模型的优美性 被引量:1

Exploring Gracefulness of Several Classes of Network Models with Kernels of Complete Graphs
原文传递
导出
摘要 在复杂网络研究中,人们需要建立网络模型,无标度图就是这样的一种网络模型.我们发现具有完全图核心的网络模型可以演变成无标度图.具有完全图核心的几种网络模型的优美性得到研究. It has been known that one need to build up network models in researching of complex networks.Scale-free graphs can be such models.We discover that some models with kernels of complete graphs may evolve to scale-free graphs.We investigate the gracefulness of several classes of models with kernels of complete graphs.
出处 《数学的实践与认识》 CSCD 北大核心 2014年第2期210-215,共6页 Mathematics in Practice and Theory
基金 国家自然科学基金(61163054 61163037)
关键词 优美标号 复杂网络 无标度图 graceful labellings complex networks scale-free graphs kernels
  • 相关文献

参考文献5

  • 1Bing Yao,Xiangqian Zhou,Jiajuan Zhang,Xiang'en Chen,Xiaoming Zhang,Jianming Xie,Ming Yao,Mogang Li. Labellings And Invariants Of Models From Complex Networks[J].
  • 2Adrian Bondy J,Murty U S R. Graph Theory with Applications[M].London:The Macmillan Press,1976.
  • 3Joseph A Gallian. ADynam ic Survey ofGraph Labelling[J].The Electronic Journal of Combinatorics,2009.211-219.
  • 4Bing Yao,Hui Cheng,Ming Yao,Meimei Zhao. A note on strongly graceful trees[J].{H}Australasian Journal of Combinatorics,2009.155-169.
  • 5Xiangqian Zhou,Bing Yao,Xiang'en Chen,Haixia Tao. A proof to the odd-gracefulness of all lobsters[J].Ars Combinatoria Volume CⅢ,2012.13-18.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部