摘要
复杂网络已经被证实有着广泛的实际应用,帮助人们揭示了很多复杂系统中的普世规律,如无标度特征.文章介绍几个典型的确定型网络模型,同时,学习这些模型中的一些拓扑结构参数,如最多叶子生成树数目,准确地解析出了相应参数的数值表达式.结果表明,这些拓扑参数可以很好地区分网络拓扑结构之间的差异性.
Complex networks have been proven useful in a wide range of real-world applications.As a result,this helps us to unveil some rules,for instance,scale-free feature,popularly observed in a great number of complex systems.In this paper,we will introduce several typical deterministic networked models and then study some topological structural parameters such as,the total number of maximum leaf spanning trees.Finally,we analytically derive the corresponding closed-form solutions.The results show that topological parameters considered here can be able to distinguish the underlying structures of networked models.
作者
马飞
姚兵
MA Fei;YAO Bing(School of Electronics Engineering and Computer Science,Peking University,Beijing 100871,China;College of Mathematics and Statistics,Northwest Normal University,Lanzhou 730070,China)
出处
《广州大学学报（自然科学版）》
CAS
2020年第1期34-41,共8页
Journal of Guangzhou University:Natural Science Edition
基金
国家自然科学基金资助项目(61662066)
关键词
复杂网络
生成树
独立集
complex networks
spanning tree
independent set
