Hierarchical structure and particular spanning trees of edge-bound growing network models

In order to interpret the dynamical nature of networks, one must realize the integrated features of network models as well as the partial characters, such as degree distribution. Hence, studying topological structure of complex networks is significant and raises scholar´s concern at home and aboard. We focus on building up a type of edge-bound growing network model(E-BGN model) by construction algorithm based on the seeds in order to provide various network models, we validate some properties of the E-BGN model, such as hierarchy and small-world. Furthermore, we project an algorithm for the sake of finding particular spanning trees which have maximum leaves (MLS-trees) of the E-BGN model. Besides, we analysis the particular MLS-trees and provide the degree distribution of the MLS-trees in this article.