Network robustness and residual closeness
Authors:
- 1 July 2018
- journal article
- research article
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 52 (3) , 839-847
Abstract
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.Keywords
This publication has 23 references indexed in Scilit:
- Effective usage of shortest paths promotes transportation efficiency on scale-free networksPhysica A: Statistical Mechanics and its Applications, 2013
- RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKSInternational Journal of Foundations of Computer Science, 2011
- Modeling contaminant intrusion in water distribution networks: A new similarity-based DST methodExpert Systems with Applications, 2011
- EFFICIENCY DYNAMICS ON SCALE-FREE NETWORKS WITH COMMUNITIESModern Physics Letters B, 2010
- Facility location and supply chain management – A reviewEuropean Journal of Operational Research, 2009
- Residual closeness in networksPhysica A: Statistical Mechanics and its Applications, 2006
- Measuring the vulnerability for classes of intersection graphsDiscrete Applied Mathematics, 1997
- On a class of posets and the corresponding comparability graphsJournal of Combinatorial Theory, Series B, 1978
- Tough graphs and hamiltonian circuitsDiscrete Mathematics, 1973
- Analysis and Design of Survivable NetworksIEEE Transactions on Communications, 1970