Non-planar unclustered Peterson graphs as scale-free models of the Internet of Things
Many real life networks present diameter logarithmic with the number of nodes and degree distribution that follow power law.Often these networks have also a modular and.self-similar feature and usually associated with topological restrictions-their clustering is low,even zero,and they are almost non-planar.In the paper,we propose a generalized self-similarity growing network model.As the construction is deterministic,we can capture exact analytic expressions for relevant properties of the model including average degree,clustering coefficient,degree distribution,diameter,the number of leaves of every maximum-leaf spanning tree.We make a conclusion that it is scale-free and small-world.
scale-free model Peterson graph complex network self-similar graph non-planar structure
Fei Ma Bing Yao Ming Yao
College of Mathematics and Statistics,Northwest Normal University,Lanzhou,China Department of Information Process and Control Engineering,Lanzhou Petrochemical College of Vocationa
国际会议
重庆
英文
1040-1043
2016-03-20（万方平台首次上网日期，不代表论文的发表时间）