Uniformly bound-growing network models and their spanning trees

To understand the dynamical phenomena of networks, one must know the global properties of networks as well as the local properties such as the degree distribution. So, researching topological structures of complex networks is important and catches many researchers' attention. A class of bound growing network models (BGN-models) has been defined in this article. We determine some properties of the bound growing network models, such as scale-free, power law distribution, degree cumulative distribution. Since thousands of Autonomous Systems (ASes) and networks have more leaves, we provide an algorithm for finding spanning trees having maximum leaves (ML-spanning trees) in the BGN-models, and determine some important properties of ML-spanning trees as well as apply ML-spanning trees to determine balanced and dominating sets in BGN-models.