Open AccessDurer‐pentagon‐based complex network
Author(s) -
Hou Rui,
Chang Yuejiana,
Chang Yuzhou
Publication year - 2016
Publication title -
the journal of engineering
Language(s) - English
Resource type - Journals
ISSN - 2051-3305
DOI - 10.1049/joe.2015.0139
Subject(s) - pentagon , clustering coefficient , complex network , average path length , node (physics) , path (computing) , cluster analysis , computer science , fractal , fractal dimension , path length , topology (electrical circuits) , artificial intelligence , mathematics , combinatorics , computer network , theoretical computer science , geometry , physics , shortest path problem , world wide web , mathematical analysis , quantum mechanics , graph
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.