{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T14:55:05Z","timestamp":1773154505695,"version":"3.50.1"},"reference-count":4,"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":13067,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1971,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A graph is k\u2010arc\u2010connected if it is necessary to remove at least k arcs in order to disconnect the graph. This paper solves the problem of determining the least number of arcs required in a k\u2010arc\u2010connected graph on n nodes by describing constructions that produce such graphs having kn\/2 arcs (for kn \u00e9ven) or (kn+1) \/2 arcs (for kn odd). These results have application to the practical problem of synthesizing minimum cost, \u201ck\u2010reliable\u201d communication networks.<\/jats:p>","DOI":"10.1002\/net.3230010108","type":"journal-article","created":{"date-parts":[[2007,5,10]],"date-time":"2007-05-10T22:54:56Z","timestamp":1178837696000},"page":"91-98","source":"Crossref","is-referenced-by-count":10,"title":["Minimal k\u2010arc connected graphs"],"prefix":"10.1002","volume":"1","author":[{"given":"D. R.","family":"Fulkerson","sequence":"first","affiliation":[]},{"given":"L. S.","family":"Shapley","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Theorie des Graphes et ses Applications","author":"Berge C.","year":"1958"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.2307\/2371086"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230010108","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230010108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T03:53:05Z","timestamp":1699761185000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230010108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1971,1]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1971,1]]}},"alternative-id":["10.1002\/net.3230010108"],"URL":"https:\/\/doi.org\/10.1002\/net.3230010108","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1971,1]]}}}