{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T11:40:30Z","timestamp":1698061230273},"reference-count":13,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":8259,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1984,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Boesch, Harary, and Kabell recently introduced two measures of network vulnerability. They defined the persistence (edge persistence) of a graph as the minimum number of vertices (edges) whose deletion increases the diameter. In their paper they posed questions relating the existence of graphs with a prescribed number of edges, number of vertices, diameter, and persistence (edge persistence). In this paper we consider this extremal problem.<\/jats:p>","DOI":"10.1002\/net.3230140111","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T17:22:52Z","timestamp":1178904172000},"page":"141-146","source":"Crossref","is-referenced-by-count":7,"title":["Vulnerability of communication networks"],"prefix":"10.1002","volume":"14","author":[{"given":"Louis","family":"Caccetta","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"3","article-title":"The diameter of graphs\u2010A survey","volume":"32","author":"Bermond J. C.","year":"1981","journal-title":"Congr. Numer."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110106"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01894682"},{"key":"e_1_2_1_5_2","series-title":"London Math. Soc. Monographs No. 11","volume-title":"External Graph Theory","author":"Bollob\u00e1s B.","year":"1978"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(76)80003-2"},{"key":"e_1_2_1_7_2","first-page":"281","article-title":"Extremal graphs with given diameter and connectivity","volume":"1","author":"Bollob\u00e1s B.","year":"1976","journal-title":"Ars. Combinatoria"},{"key":"e_1_2_1_8_2","volume-title":"Graph Theory With Applications","author":"Bondy J. A.","year":"1977"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1749-6632.1979.tb17769.x"},{"key":"e_1_2_1_10_2","first-page":"17","volume-title":"Applications of Graph Theory","author":"Cattermole K. W.","year":"1978"},{"key":"e_1_2_1_11_2","first-page":"572","article-title":"An extremal problem in communication networks","volume":"319","author":"Kabell J. A.","year":"1979","journal-title":"Ann. N.Y. Acad. Sci."},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.2307\/2688184"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(68)80030-4"},{"key":"e_1_2_1_14_2","first-page":"299","article-title":"On accessibility in graphs","volume":"26","author":"Vijayan K.","year":"1964","journal-title":"Sankhya Ser. A"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230140111","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230140111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T23:19:40Z","timestamp":1697757580000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230140111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,3]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,3]]}},"alternative-id":["10.1002\/net.3230140111"],"URL":"https:\/\/doi.org\/10.1002\/net.3230140111","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,3]]}}}