scholarly journals Exploring triad-rich substructures by graph-theoretic characterizations in complex networks

2017 ◽  
Vol 468 ◽  
pp. 53-69 ◽  
Author(s):  
Songwei Jia ◽  
Lin Gao ◽  
Yong Gao ◽  
James Nastos ◽  
Xiao Wen ◽  
...  
Keyword(s):  
Complex Networks ◽  
Graph Theoretic

Network robustness and residual closeness

2018 ◽  
Vol 52 (3) ◽  
pp. 839-847
Author(s):  
Aysun Aytaç ◽  
Zeynep Nihan Odabaş Berberler
Keyword(s):  
Complex Networks ◽  
Interconnection Networks ◽  
Network Reliability ◽  
Central Issue ◽  
Network Robustness ◽  
Graph Theoretic ◽  
Theoretic Concept ◽  
Individual Nodes

A central issue in the analysis of complex networks is the assessment of their robustness and vulnerability. A variety of measures have been proposed in the literature to quantify the robustness of networks and a number of graph-theoretic parameters have been used to derive formulas for calculating network reliability. In this paper, we study the vulnerability of interconnection networks to the failure of individual nodes, using a graph-theoretic concept of residual closeness as a measure of network robustness which provides a much fuller characterization of the network.

Complex Networks

2009 ◽  
Author(s):  
Reuven Cohen ◽  
Shlomo Havlin
Keyword(s):  
Complex Networks
Sign in / Sign up

Export Citation Format

Share Document