This is an open access article published by the IET under the Creative Commons Attribution License (http://creativecommons.org/licenses/by/3.0/)
A novel Durer-pentagon-based complex network was constructed by adding a centre node. The properties of the complex network including the average degree, clustering coefficient, average path length, and fractal dimension were determined. The proposed complex network is small-world and fractal.
References
-
-
1)
-
3. Zhang, Z., Zhou, Y., Fang, J.: ‘Recent progress of deterministic models for complex networks’, Complex Syst. Complex. Sci., 2008, 5, (4), pp. 29–46.
-
2)
-
2. Barabási, A.-L., Albert, R.: ‘Emergence of scaling in random networks’, Science, 1999, 286, (5439), pp. 509–512 (doi: 10.1126/science.286.5439.509).
-
3)
-
11. Knora, M., Škrekovski, R.: ‘Deterministic self-similar models of complex networks based on very symmetric graphs’, Physica A, 2013, 392, (19), pp. 4629–4637 (doi: 10.1016/j.physa.2013.06.001).
-
4)
-
14. Zhang, Z., Zhou, S., Zou, T., et al: ‘Incompatibility networks as models of scale-free small-world graphs’, Eur. Phys. J. B, 2007, 60, (2), pp. 259–264 (doi: 10.1140/epjb/e2007-00344-7).
-
5)
-
1. Steven, H.S.: ‘Exploring complex networks’, Nature, 2001, 410, (6825), pp. 268–276 (doi: 10.1038/35065725).
-
6)
-
6. Shenela, B.L.: ‘It's a small world: fusion of cultures in genetic counseling’, J. Genet. Couns., 2012, 21, (2), pp. 20–208.
-
7)
-
4. Zhu, D., Wang, D., Hassan, S., et al: ‘Small-world phenomenon of keywords network based on complex network’, Scientometrics, 2013, 97, pp. 435–442 (doi: 10.1007/s11192-013-1019-3).
-
8)
-
19. Song, C., Havlin, S., Makse, H.: ‘Self-similarity of complex networks’, Nature, 2005, 433, pp. 392–395 (doi: 10.1038/nature03248).
-
9)
-
10. Comellas, F., Ozón, J., Peters, J.G.: ‘Deterministic small-world communication networks’, Inf. Process. Lett., 2000, 76, (1–2), pp. 83–90 (doi: 10.1016/S0020-0190(00)00118-6).
-
10)
-
15. Liu, J., Kong, X.: ‘Establishment and structure properties of the scale-free Koch network’, Acta Phys. Sin., 2010, 59, (4), pp. 2244–2249.
-
11)
-
5. Jin, X., Li, J.: ‘Research on statistical feature of online social networks based on complex network theory’. 2014 Seventh Int. Joint Conf. on Computational Sciences and Optimization, 2014, pp. 35–39.
-
12)
-
1. Newman, M.E.J.: ‘The structure and function of complex networks’, SIAM Rev., 2003, 45, (2), pp. 167–256 (doi: 10.1137/S003614450342480).
-
13)
-
14)
-
9. Barabási, A.L., Ravasz, E., Vicsek, T.: ‘Deterministic scale-free networks’, Physica A, 2001, 299, pp. 559–564 (doi: 10.1016/S0378-4371(01)00369-7).
-
15)
-
1. Watts, D.J., Strongatz, S.H.: ‘Collective dynamics of small world networks’, Nature, 1998, 393, pp. 440–442 (doi: 10.1038/30918).
-
16)
-
16. Le, A., Gao, F., Xi, L., et al: ‘Complex networks modeled on the Sierpinski gasket’, Physica A, 2015, 436, pp. 646–657 (doi: 10.1016/j.physa.2015.05.048).
-
17)
-
12. Andrade, J.S., Herrmann, H.J., Andrade, R.F.S., et al: ‘Apollonian networks: simultaneously scale-free, small world, Euclidean, space filling, and with matching graphs’, Phys. Rev. Lett., 2005, 94, (1), p. 018702 (doi: 10.1103/PhysRevLett.94.018702).
-
18)
-
18. Falconer, K.: ‘Fractal geometry: mathematical foundations and applications’ (John Wiley & Sons, Inc. Press, 2007, 2nd edn.).
-
19)
-
13. Zhang, Z., Comellas, F., Fertin, G., et al: ‘High dimensional Apollonian networks’, Physics A, 2006, 39, (8), pp. 1811–1818 (doi: 10.1088/0305-4470/39/8/003).
http://iet.metastore.ingenta.com/content/journals/10.1049/joe.2015.0139
Related content
content/journals/10.1049/joe.2015.0139
pub_keyword,iet_inspecKeyword,pub_concept
6
6