TY  - JOUR
T1  - The Reliability of Small World Network
AU - Khattabi, Noussaima El. AU - Yakoubi, Fouad AU - Marraki, Mohamed El. 
JO  - Journal of Engineering and Applied Sciences
VL  - 14
IS  - 10
SP  - 3260
EP  - 3265
PY  - 2019
DA  - 2001/08/19
SN  - 1816-949x
DO  - jeasci.2019.3260.3265
UR  - https://makhillpublications.co/view-article.php?doi=jeasci.2019.3260.3265
KW  - Number of spanning trees
KW  -asymptotic entropy
KW  -network reliability
KW  -complex network
KW  -small world
network
KW  -bipartite method
KW  -reduction method
AB  - The asymptotic spanning tree entropy is a natural measure related to topological and dynamic properties of networks, namely their reliability. However, computing the number of spanning trees of networks using classical algebraic methods is very demanding tasks on term computational resources and time, especially for large networks such as complex networks. In this study, we give an analytic formula for the number of spanning trees and the asymptotic entropy of two type of small-world networks G<sub>k</sub> and C<sub>k</sub> by using two methods of decomposition based on geometrical transformation which are Bipartite method and Reduction method. Then, we estimate and compare the robustness level of the networks G<sub>k</sub> and C<sub>k</sub> that have the same average degree of nodes.
ER  -