Volume 52, Number 3, July–September 2018
|Page(s)||839 - 847|
|Published online||23 October 2018|
Network robustness and residual closeness
Faculty of Science, Department of Mathematics, Ege University, 35100
2 Faculty of Science, Department of Computer Science, Dokuz Eylul University, 35160 İzmir, Turkey
* Corresponding author: email@example.com
Accepted: 27 October 2016
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.
Mathematics Subject Classification: 05C40 / 68M10 / 68R10
Key words: Graph vulnerability / closeness / network design and communication / stability / communication network
© EDP Sciences, ROADEF, SMAI 2018
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.