Topological Structure and Spanning Trees of Rectangular Growing Network Models

Xia Liu; Bing Yao; Wan Jia Zhang; Xiang En Chen; Xiao Min Zhang

doi:10.4028/www.scientific.net/AMM.644-650.1805

Paper Titles

Research of Data Mining Algorithm Based on the Intrusion Prevention System
p.1787

The Research in Satellite Television Channel Landing Fee of China Based on PageRank Algorithm
p.1791

Methods of Projecting 2D Wrinkle Curves onto a 3D Model
p.1796

Research on Resource Scheduling in Cloud Computing: Issues and Solutions
p.1801

Topological Structure and Spanning Trees of Rectangular Growing Network Models
p.1805

Implement of Hyper-Graph System Based on Three-Dimensional Matrix Model
p.1809

Distance Learning Classroom Communication System Based on Cloud Computing
p.1813

Mass Data Efficient Scheduling Model with Cloud Computing on Android Platform
p.1817

Simulation on Data Energy-Efficient Scheduling Model of Cloud Computing
p.1822

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 644-650Topological Structure and Spanning Trees of...

Topological Structure and Spanning Trees of Rectangular Growing Network Models

Abstract:

Fractals in building network models are objects which appear similar (at least in some statistical sense) at every lengthscale. We focus on produce the rectangular growing network models by constructive operations based on fractals, and show the scale-free behaviors of our models. We, also, try to find those nodes like “hubs” in the models by spanning trees having maximal leaves.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 644-650)

Pages:

1805-1808

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.644-650.1805

Citation:

Cite this paper

Online since:

September 2014

Authors:

Xia Liu, Bing Yao*, Wan Jia Zhang, Xiang En Chen, Xiao Min Zhang

Keywords:

02.10.Ox, 89.75.Fb, Growing Network, Scale-Free Network, Spanning Tree. 89.75.Da

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Reuven Cohen, Shlomo Havlin, and Daniel ben-Avraham. Structural properties of scale-free networks in Handbook of Graphs and Networks From the Genome to the Internet, WILEY-VCH GmbH and Co. KGaA, Weinheim, (2003).

DOI: 10.1002/3527602755.ch4

Google Scholar

[2] M. Garey, D. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, (1979).

Google Scholar

[3] M. E. J. Newman, The structure and function of complex networks, SIAM Review 45, 167 (2003), 167-256.

Google Scholar

[4] Hongyu Wang, Bing Yao, Ming Yao. Generalized Edge-Magic Total Labellings Of Models from reseaching Networks. Information Sciences 279 (2014) 460-467. DOI: 10. 1016/j. ins. 2014. 03. 132.

DOI: 10.1016/j.ins.2014.03.132

Google Scholar

[5] Hongyu Wang, Bing Yao, Chao Yang, Sihua Yang, Xiang'En Chen. Labelling Properties Of Models Related with Complex Networks Based On Constructible Structures. Advanced Materials Research Vols. 765-767 (2013) pp.1118-1123.

DOI: 10.4028/www.scientific.net/amr.765-767.1118

Google Scholar

[6] Bing Yao, Chao Yang, Ming Yao, Hongyu Wang, Xiang'en Chen, Xiaomin Zhang, Mogang Li. Graphs As Models of Scale-free Networks. 2013 International Conference on Information Technology and Computer Applications (ITCA 2013) 3680-3684. Applied Mechanics and Materials, Vol. 380-384 (2013).

DOI: 10.1109/nces.2012.6544070

Google Scholar

[7] Bing Yao, Jiajuan Zhang, Xiangqian Zhou, Xiang'en Chen, Xiaomin Zhang, Ming Yao, Mogang Li. Induced Total Labellings of Models as Scale-free Networks. Communications and Network, Vo. 513-517, 2013, 5, 65-68.

DOI: 10.4236/cn.2013.53b2013

Google Scholar

[8] Bing Yao, Ming Yao, Xiang-en Chen, Xia Liu, Wan-jia Zhang. Research on Edge-Growing Models Related with Scale-Free Small-World Networks. Applied Mechanics and Materials, Volumes 513-517, (2013) pp.2444-2448.

DOI: 10.4028/www.scientific.net/amm.513-517.2444

Google Scholar

[9] Bing Yao, Ming Yao, Sihua Yang, Xiang'en Chen, Xiaomin Zhang. Labelling Edges of Models from Complex Networks. Applied Mechanics and Materials, Volumes 513-517 (2013) pp.1858-1862.

DOI: 10.4028/www.scientific.net/amm.513-517.1858

Google Scholar

[10] Bing Yao, Zhong-fu Zhang and Jian-fang Wang. Some results on spanning trees. Acta Mathematicae Applicatae Sinica, English Series, 2010, 26(4). 607-616.

DOI: 10.1007/s10255-010-0011-4

Google Scholar

[11] Bing Yao, Xia Liu, Wan-jia Zhang, Xiang'en Chen, Xiao-min Zhang, Ming Yao, Zheng-xue Zhao. Applying Graph Theory To The Internet of Things. 2013 IEEE International Conference on High Performance Computing and Communications and 2013 IEEE International Conference on Embedded and Ubiquitous Computing, 2354-2361.

DOI: 10.1109/hpcc.and.euc.2013.339

Google Scholar

[12] Zhong-zhi Zhang, Li-li Rong, Chong-hui Guo. A deterministic small-world network created by edge iterations. Physica A, 2006, 363: 567-572.

DOI: 10.1016/j.physa.2005.08.020

Google Scholar

[13] Zhongzhi Zhang, Shuigeng Zhou, Lujun Fang, Jihong Guan and Yichao Zhang. Maximal planar scale-free Sierpinski networks with small-world effect and power-law strength-degree correlation. EPL (Europhysics Letters), 79 (2007): 38007.

DOI: 10.1209/0295-5075/79/38007

Google Scholar

[14] Xiangqian Zhou, Bing Yao, Xiang'en Chen. Every Lobster Is Odd-elegant. Information Processing Letters 113 (2013) 30-33.

DOI: 10.1016/j.ipl.2012.09.008

Google Scholar