{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T21:10:10Z","timestamp":1725916210887},"reference-count":4,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":7437,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1986,6]]},"abstract":"Abstract<\/jats:title>The problem of describing graphs representing a communication network which are optimally reliable has been studied both for the case of vertex failures and for the case of edge failures. We give a combinatorial definition in each case and show that under certain conditions the first definition implies the second. We use this result to investigate the existence of graphs which in some sense are optimally reliable with respect to both vertex and edge failures.<\/jats:p>","DOI":"10.1002\/net.3230160208","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T20:50:04Z","timestamp":1178916604000},"page":"199-204","source":"Crossref","is-referenced-by-count":8,"title":["Optimally reliable graphs for both edge and vertex failures"],"prefix":"10.1002","volume":"16","author":[{"given":"Trefor","family":"Evans","sequence":"first","affiliation":[]},{"given":"Derek","family":"Smith","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"D.Bauer F.Bocsch C.Suffel andR.Tindell Combinatorial optimization problems in the analysis and design of probabilistic networks. Stevens Research Report in Mathematics #8202 Stevens Institute of Technology 1982."},{"key":"e_1_2_1_3_2","unstructured":"F. T.BoeschandJ. F.Wang Super line\u2010connectivity properties of circulant graphs. EECS Department Report #8303 Stevens Institute of Technology 1983."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140105"},{"key":"e_1_2_1_5_2","first-page":"171","article-title":"Reliable networks and (k,2k \u2010 2)\u2010connected gaphs. Proceedings of the Ninth British Combinatorial Conference","volume":"16","author":"Smith D. H.","year":"1983","journal-title":"Ars Combinatoria"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230160208","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230160208","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T01:54:44Z","timestamp":1697853284000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230160208"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,6]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,6]]}},"alternative-id":["10.1002\/net.3230160208"],"URL":"https:\/\/doi.org\/10.1002\/net.3230160208","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,6]]}}}