{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T18:55:25Z","timestamp":1772650525652,"version":"3.50.1"},"reference-count":34,"publisher":"EDP Sciences","issue":"3","license":[{"start":{"date-parts":[[2018,10,23]],"date-time":"2018-10-23T00:00:00Z","timestamp":1540252800000},"content-version":"vor","delay-in-days":114,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2016,10,27]]},"published-print":{"date-parts":[[2018,7]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1051\/ro\/2016071","type":"journal-article","created":{"date-parts":[[2016,10,31]],"date-time":"2016-10-31T07:34:12Z","timestamp":1477899252000},"page":"839-847","source":"Crossref","is-referenced-by-count":18,"title":["Network robustness and residual closeness"],"prefix":"10.1051","volume":"52","author":[{"given":"Aysun","family":"Ayta\u00e7","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeynep Nihan Odaba\u015f","family":"Berberler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2018,10,23]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1142\/S0129054111008660","volume":"22","author":"Ayta\u00e7","year":"2011","journal-title":"Int. J. Foundations Comput. Sci"},{"key":"R2","first-page":"13","volume":"1","author":"Barefoot","year":"1987","journal-title":"J. Combin. Math. Combin. Comput"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"Phillips C.A. and \nSwiler L.P., \nA graph-based system for network vulnerability analysis, In \nNew Security Paradigms Workshop \n(1998) 71\u201379","DOI":"10.1145\/310889.310919"},{"key":"R4","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1016\/j.physa.2005.12.020","volume":"365","author":"Dangalchev","year":"2006","journal-title":"Physica A"},{"key":"R5","doi-asserted-by":"crossref","first-page":"1939","DOI":"10.1142\/S0129054111009136","volume":"22","author":"Dangalchev","year":"2011","journal-title":"Int. J. Found. Comput. Sci"},{"key":"R6","first-page":"57","volume":"9","author":"Liu","year":"2014","journal-title":"PLoS One"},{"key":"R7","unstructured":"West D.B., \nIntroduction to Graph Theory. \nPrentice Hall, \nNJ \n(2001)"},{"key":"R8","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/S0166-218X(96)00133-3","volume":"77","author":"Kratsch","year":"1997","journal-title":"Discrete Appl. Math"},{"key":"R9","unstructured":"Buckley F. and \nHarary F., \nDistance in Graphs, \nAddison-Wesley Publishing Company Advanced Book Program, \nRedwood City, CA \n(1990)"},{"key":"R10","unstructured":"Chartrand G. and \nLesniak L., \nGraphs and Digraphs, 2nd Edition, \nWadsworth. \nMonterey \n(1986)"},{"key":"R11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0095-8956(78)90013-8","volume":"24","author":"Jung","year":"1978","journal-title":"J. Combinatorial Theory, Series B"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"Frank H. and \nFrisch I.T., \nAnalysis and design of survivable networks. \nIEEE Trans. Commun. Tech. COM-18 567 \n(1970)","DOI":"10.1109\/TCOM.1970.1090419"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"Bondy J.A. and \nMurty U.S.R., \nGraph theory with applications. \nAmerican Elsevier Publishing Co., Inc., New York \n(1976)","DOI":"10.1007\/978-1-349-03521-2"},{"key":"R14","doi-asserted-by":"crossref","first-page":"e0146896","DOI":"10.1371\/journal.pone.0146896","volume":"11","author":"Gou","year":"2016","journal-title":"PLoS One"},{"key":"R15","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.physa.2014.03.031","volume":"406","author":"Saniee Monfared","year":"2014","journal-title":"Phys. A: Statist. Mech. Appl"},{"key":"R16","unstructured":"Cozzens M., \nMoazzami D. and \nStueckle S., \nSeventh International Conference on the Theory and Applications of Graphs. \nWiley, New York \n(1995) 1111\u20131122"},{"key":"R17","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.ejor.2008.05.007","volume":"196","author":"Melo","year":"2009","journal-title":"Eur. J. Oper. Res"},{"key":"R18","first-page":"056","volume":"65","author":"Holme","year":"2002","journal-title":"Phys. Rev. E"},{"key":"R19","doi-asserted-by":"crossref","first-page":"1889","DOI":"10.1142\/S0217984911027133","volume":"25","author":"Tang","year":"2011","journal-title":"Modern Phys. Lett. B"},{"key":"R20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2014.07.001","volume":"544","author":"Boccaletti","year":"2014","journal-title":"Phys. Repor"},{"key":"R21","doi-asserted-by":"crossref","first-page":"043110","DOI":"10.1063\/1.2801687","volume":"17","author":"Boccaletti","year":"2007","journal-title":"Chaos"},{"key":"R22","first-page":"419","volume":"118","author":"Turac\u0131","year":"2015","journal-title":"Ars Combinatoria"},{"key":"R23","unstructured":"Ayta\u00e7 V. and \nTurac \u0131 T., Computing the Closeness Centrality in Some Graphs, Submitted."},{"key":"R24","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","volume":"5","author":"Chv\u00e0tal","year":"1973","journal-title":"Discrete Math"},{"key":"R25","doi-asserted-by":"crossref","first-page":"3505","DOI":"10.1016\/j.physa.2013.03.032","volume":"392","author":"Du","year":"2013","journal-title":"Phys. A Statist. Mech. Appl"},{"key":"R26","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/j.eswa.2013.07.018","volume":"41","author":"Deng","year":"2014","journal-title":"Expert Syst. Appl"},{"key":"R27","doi-asserted-by":"crossref","first-page":"1549","DOI":"10.1142\/S0217984910023347","volume":"24","author":"Qi","year":"2010","journal-title":"Modern Phys. Lett. B"},{"key":"R28","first-page":"878024","volume":"2015","author":"Deng","year":"2015","journal-title":"Math. Problems Eng"},{"key":"R29","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/j.eswa.2010.07.004","volume":"38","author":"Deng","year":"2011","journal-title":"Expert Syst. Appl"},{"key":"R30","first-page":"212794","volume":"2015","author":"Deng","year":"2015","journal-title":"Math. Problems Eng"},{"key":"R31","doi-asserted-by":"crossref","first-page":"9295","DOI":"10.1038\/srep09295","volume":"5","author":"Gao","year":"2015","journal-title":"Sci. Rep"},{"key":"R32","doi-asserted-by":"crossref","first-page":"297","DOI":"10.3233\/FI-2013-835","volume":"124","author":"Odaba\u015f","year":"2013","journal-title":"Fundam. Inform"},{"key":"R33","doi-asserted-by":"crossref","first-page":"052813","DOI":"10.1103\/PhysRevE.89.052813","volume":"89","author":"Wang","year":"2014","journal-title":"Phys. Rev. E"},{"key":"R34","doi-asserted-by":"crossref","first-page":"011149","DOI":"10.1103\/PhysRevE.85.011149","volume":"85","author":"Wang","year":"2012","journal-title":"Phys. Rev. E"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2016071\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T07:42:57Z","timestamp":1584690177000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2016071"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":34,"journal-issue":{"issue":"3"},"alternative-id":["ro160051"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2016071","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7]]}}}