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: Graph vulnerability, closeness, network design and communication, stability, communication network
Aytaç, Aysun 1 ; Berberler, Zeynep Nihan Odabaş 1
@article{RO_2018__52_3_839_0,
author = {Ayta\c{c}, Aysun and Berberler, Zeynep Nihan Odaba\c{s}},
title = {Network robustness and residual closeness},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
pages = {839--847},
year = {2018},
publisher = {EDP Sciences},
volume = {52},
number = {3},
doi = {10.1051/ro/2016071},
mrnumber = {3868448},
zbl = {1403.05152},
language = {en},
url = {https://www.numdam.org/articles/10.1051/ro/2016071/}
}
TY - JOUR AU - Aytaç, Aysun AU - Berberler, Zeynep Nihan Odabaş TI - Network robustness and residual closeness JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2018 SP - 839 EP - 847 VL - 52 IS - 3 PB - EDP Sciences UR - https://www.numdam.org/articles/10.1051/ro/2016071/ DO - 10.1051/ro/2016071 LA - en ID - RO_2018__52_3_839_0 ER -
%0 Journal Article %A Aytaç, Aysun %A Berberler, Zeynep Nihan Odabaş %T Network robustness and residual closeness %J RAIRO - Operations Research - Recherche Opérationnelle %D 2018 %P 839-847 %V 52 %N 3 %I EDP Sciences %U https://www.numdam.org/articles/10.1051/ro/2016071/ %R 10.1051/ro/2016071 %G en %F RO_2018__52_3_839_0
Aytaç, Aysun; Berberler, Zeynep Nihan Odabaş. Network robustness and residual closeness. RAIRO - Operations Research - Recherche Opérationnelle, Tome 52 (2018) no. 3, pp. 839-847. doi: 10.1051/ro/2016071
[1] and , Residual Closeness of Wheels and Related Networks. Int. J. Foundations Comput. Sci. 22 (2011) 1229–1240 | MR | Zbl | DOI
[2] , and , Vulnerability in graphs-a comparative survey. J. Combin. Math. Combin. Comput. 1 (1987) 13–22 | MR | Zbl
[3] and , A graph-based system for network vulnerability analysis, In New Security Paradigms Workshop (1998) 71–79
[4] , Residual Closeness in Networks. Physica A 365 (2006) 556–564 | DOI
[5] , Residual closeness and generalized closeness. Int. J. Found. Comput. Sci. 22 (2011) 1939–1948 | MR | Zbl | DOI
[6] , and , Particle Swarm Optimization with Scale-Free Interactions. PLoS One 9 (2014) 57–57
[7] , Introduction to Graph Theory. Prentice Hall, NJ (2001) | MR | Zbl
[8] , and , Measuring the vulnerability for classes of intersection graphs. Discrete Appl. Math. 77 (1997) 259–270 | MR | Zbl | DOI
[9] and , Distance in Graphs, Addison-Wesley Publishing Company Advanced Book Program, Redwood City, CA (1990) | MR | Zbl
[10] and , Graphs and Digraphs, 2nd Edition, Wadsworth. Monterey (1986) | MR | Zbl
[11] , On a class of posets and the corresponding comparability graphs. J. Combinatorial Theory, Series B 24 (1978) 125–133 | MR | Zbl | DOI
[12] and , Analysis and design of survivable networks. IEEE Trans. Commun. Tech. COM-18 567 (1970) | MR
[13] and , Graph theory with applications. American Elsevier Publishing Co., Inc., New York (1976) | MR | Zbl
[14] , , , and , Topological Vulnerability Evaluation Model Based on Fractal Dimension of Complex Networks. PLoS One 11 (2016) e0146896 | DOI
[15] , and , Topology and vulnerability of the Iranian power grid. Phys. A: Statist. Mech. Appl. 406 (2014) 24–33 | DOI
[16] , and , Seventh International Conference on the Theory and Applications of Graphs. Wiley, New York (1995) 1111–1122 | MR | Zbl
[17] , and , Facility location and supply chain management a review. Eur. J. Oper. Res. 196 (2009) 401–412 | MR | Zbl | DOI
[18] , , and , Attack vulnerability of complex networks. Phys. Rev. E 65 (2002) 056–109 | DOI
[19] , and , Detecting Chaos Time Series via Complex Network Feature. Modern Phys. Lett. B 25 (2011) 1889–1896 | DOI
[20] , , , , and , The structure and dynamics of multilayer networks. Phys. Repor. 544 (2014) 1–122 | MR | DOI
[21] , , , , and , Multiscale vulnerability of complex networks. Chaos 17 (2007) 043110 | Zbl | DOI
[22] and , Vulnerability Of Mycielski Graphs Via Residual Closeness. Ars Combinatoria 118 (2015) 419–427 | MR | Zbl
[23] and , Computing the Closeness Centrality in Some Graphs, Submitted.
[24] , Tough graphs and Hamiltonian circuits. Discrete Math. 5 (1973) 215–228 | MR | Zbl | DOI
[25] , and , Effective usage of shortest paths promotes transportation efficiency on scale-free networks. Phys. A Statist. Mech. Appl. 392 (2013) 3505–3512 | MR | Zbl | DOI
[26] , , and , Supplier selection using AHP methodology extended by D numbers. Expert Syst. Appl. 41 (2014) 156–167 | DOI
[27] , , and , Efficiency Dynamics on Scale-Free Networks with Communities. Modern Phys. Lett. B 24 (2010) 1549–1557 | Zbl | DOI
[28] , A Threat Assessment Model under Uncertain Environment. Math. Problems Eng. 2015 (2015) 878024 | DOI
[29] , and , Modeling contaminant intrusion in water distribution networks: a new similarity-based DST method. Expert Syst. Appl. 38 (2011) 571–578 | DOI
[30] , and , An Improved Genetic Algorithm with Initial Population Strategy for Symmetric TSP. Math. Problems Eng. 2015 (2015) 212794 | DOI
[31] , and , Selectively-informed particle swarm optimization. Sci. Rep. 5 (2015) 9295 | DOI
[32] and , Residual closeness in cycles and related networks. Fundam. Inform. 124 (2013) 297–307 | MR | Zbl | DOI
[33] , and , Degree mixing in multilayer networks impedes the evolution of cooperation. Phys. Rev. E 89 (2014) 052813 | DOI
[34] , and , Cooperation and age structure in spatial games. Phys. Rev. E 85 (2012) 011149 | DOI
Cité par Sources :
