Research on Edge-Growing Models Related with Scale-Free Small-World Networks

Understanding the topological structure of scale-free networks or small world networks is required and useful for investigation of complex networks. We will build up a class of edge-growing network models and provide an algorithm for finding spanning trees of edge-growing network models in this article.

[1]  Chonghui Guo,et al.  A deterministic small-world network created by edge iterations , 2006 .

[2]  J. Guan,et al.  Maximal planar scale-free Sierpinski networks with small-world effect and power law strength-degree correlation , 2007, 0706.3490.

[3]  Hawoong Jeong,et al.  Scale-free trees: the skeletons of complex networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Béla Bollobás,et al.  The Diameter of a Scale-Free Random Graph , 2004, Comb..

[5]  L. da F. Costa,et al.  Characterization of complex networks: A survey of measurements , 2005, cond-mat/0505185.

[6]  Frank Harary,et al.  Graph Theory , 2016 .

[7]  Xia Liu,et al.  Applying Graph theory to the Internet of Things , 2013, 2013 IEEE 10th International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing.

[8]  Bing Yao,et al.  Labelling Properties of Models Related with Complex Networks Based on Constructible Structures , 2013 .

[9]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[10]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[11]  Chao Yang,et al.  Graphs as Models of Scale-Free Networks , 2012, 2012 First National Conference for Engineering Sciences (FNCES 2012).