无标度网络的无标度性导致其各顶点之间的连接状况(度数)具有严重的不均匀分布性,无法给出无标度网络的具体结构,不能直接观察信息传播的具体路径。基于利用生成树来研究无标度网络(图)的拓扑结构思想,尝试寻找与时间和次要节点无关的无标度网络(图)的普适性结构,研究与生成树密切相关的平衡集,给出一个寻找具有较多叶子生成树的算法。
The scale-free nature of a scale-free network yields uneven distribution of connections (de-grees)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.