一类增长网络模型的生成树

Spanning Trees of a Class of Growing Network Models

由于物联网的动态性以及千万多的节点和连线,使得理解和捕捉物联网的拓扑结构变得十分困难.建立网络模型来模拟实际网络的拓扑结构,理清网络的运动规律,成为当前研究的行之有效的手段之一.一般的连通网络均含有各种各样的生成树.定义了一类边界增长网络模型,给出寻找边界增长网络模型的具有最多叶子生成树的方法,计算了具有最多叶子生成树的无标度性等统计指标,并提出(αk,βk)-生成树概念.

Since there are vast numbers of nodes and links between nodes, it is very difficult to understand and capture topological structures of the Internet of Things. One of efficient and powerful methods for stimulating real networks and tracking motion regula- tion of networks is to build up some network models. A class of bound growing network models has been constructed in this article. Note that there are many spanning trees in a connected network. A method for finding spanning trees having maximum leaves in the bound growing network models has been shown, and furthermore some important properties of spanning trees have been determined. We propose a new concept： （αk ,βk ）-spanning trees.