首页 | 本学科首页   官方微博 | 高级检索  
     检索      

探讨无标度网络(图)的平衡集
引用本文:刘霞,姚东任,姚兵,张婉佳.探讨无标度网络(图)的平衡集[J].中山大学学报(自然科学版),2015,54(1).
作者姓名:刘霞  姚东任  姚兵  张婉佳
作者单位:1.西北师范大学数学与统计学院, 甘肃 兰州 730070;
2.西北师范大学计算机科学与工程学院,甘肃 兰州 730070
基金项目:国家自然科学基金资助项目
摘    要:无标度网络的无标度性导致其各顶点之间的连接状况(度数)具有严重的不均匀分布性,无法给出无标度网络的具体结构,不能直接观察信息传播的具体路径。基于利用生成树来研究无标度网络(图)的拓扑结构思想,尝试寻找与时间和次要节点无关的无标度网络(图)的普适性结构,研究与生成树密切相关的平衡集,给出一个寻找具有较多叶子生成树的算法。

关 键 词:平衡集  连通图  生成树  无标度网络

On Balanced Sets in Scale-free Networks (Graphs)
LIU Xia,YAO Dongren,YAO Bing,ZHANG Wanjia.On Balanced Sets in Scale-free Networks (Graphs)[J].Acta Scientiarum Naturalium Universitatis Sunyatseni,2015,54(1).
Authors:LIU Xia  YAO Dongren  YAO Bing  ZHANG Wanjia
Institution:1.College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China;
2.College of Computer Science and Engineering,Northwest Normal University,Lanzhou 730070,China
Abstract:The scale free nature of a scale free network yields uneven distribution of connections (degrees) between its nodes. As the topological structures of scale free networks are not exactly figured up to now, people can not observe clearly paths of information dissemination in scale free networks. Based on the idea of using spanning trees in researching topological structures of scale-free networks, the universal structure of scale free networks without relating time and sub nodes are tried to find, and balanced sets that are extensively related with spanning trees in the networks are researched, and furthermore show an algorithm for finding spanning trees with more leaves.
Keywords:balanced set  connected graph  spanning tree  scale-free network
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《中山大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《中山大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号