{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T22:10:32Z","timestamp":1699913432871},"reference-count":30,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2009,2,13]],"date-time":"2009-02-13T00:00:00Z","timestamp":1234483200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[2009,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The <jats:italic>strongly connected reliability<\/jats:italic> scRel(<jats:italic>D<\/jats:italic>, <jats:italic>p<\/jats:italic>) of a digraph <jats:italic>D<\/jats:italic> is the probability that the spanning subgraph of <jats:italic>D<\/jats:italic> consisting of the operational arcs is strongly connected, given that the vertices always operate, but each arc independently operates with probability <jats:italic>p<\/jats:italic> \u2208 [0, 1]. We provide here some results on the location of the roots of strongly connected reliability polynomials that contrast sharply with what is known for all terminal reliability. We show that not only there can be negative real roots, but also roots of arbitrarily large modulus. In fact, the closure of the roots of strongly connected reliability polynomials contains all of the complex plane except, possibly, some subset of the unit disk centered at <jats:italic>z<\/jats:italic> = 1. \u00a9 2009 Wiley Periodicals, Inc. NETWORKS, 2009<\/jats:p>","DOI":"10.1002\/net.20301","type":"journal-article","created":{"date-parts":[[2009,2,13]],"date-time":"2009-02-13T16:37:59Z","timestamp":1234543079000},"page":"108-116","source":"Crossref","is-referenced-by-count":4,"title":["On the roots of strongly connected reliability polynomials"],"prefix":"10.1002","volume":"54","author":[{"given":"J. I.","family":"Brown","sequence":"first","affiliation":[]},{"given":"K.","family":"Dilcher","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2009,2,13]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"National Bureau of Standards","author":"Abramowitz M.","year":"1964"},{"key":"e_1_2_1_3_2","first-page":"213","volume-title":"Advances in Mathematics, Supplementary Studies 1","author":"Beraha S.","year":"1978"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(72)90016-0"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1137\/0405047"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008705614290"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2001.2057"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00402-7"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1023\/B:JACO.0000030703.39946.70"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.20060"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.20148"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-8858(03)00078-2"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2006.06.001"},{"key":"e_1_2_1_14_2","volume-title":"The combinatorics of network reliability","author":"Colbourn C.J.","year":"1987"},{"key":"e_1_2_1_15_2","series-title":"Applications of Fibonacci numbers","first-page":"143","author":"Dilcher K.","year":"1993"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90202-S"},{"key":"e_1_2_1_17_2","first-page":"19","article-title":"An identity for the independence polynomials of trees","volume":"50","author":"Gutman I.","year":"1991","journal-title":"Publ Inst Math (Belgrade)"},{"key":"e_1_2_1_18_2","first-page":"139","article-title":"Some analytic properties of the independence and matching polynomials","volume":"28","author":"Gutman I.","year":"1992","journal-title":"Match"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02163181"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0218539394000180"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/12.477253"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300000705"},{"key":"e_1_2_1_23_2","volume-title":"Selected topics in graph theory 3","author":"Read R.C.","year":"1988"},{"key":"e_1_2_1_24_2","first-page":"1009","volume-title":"Graph theory, combinatorics, and applications","author":"Read R.C.","year":"1991"},{"key":"e_1_2_1_25_2","volume-title":"Chebyshev polynomials: From approximation theory to algebra and number theory","author":"Rivlin T.J.","year":"1990"},{"key":"e_1_2_1_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2004.03.008"},{"key":"e_1_2_1_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10955-004-2055-4"},{"key":"e_1_2_1_28_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300004612"},{"key":"e_1_2_1_29_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548303006023"},{"key":"e_1_2_1_30_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548397003131"},{"key":"e_1_2_1_31_2","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548399004162"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.20301","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.20301","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T21:55:17Z","timestamp":1699912517000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.20301"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,13]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["10.1002\/net.20301"],"URL":"https:\/\/doi.org\/10.1002\/net.20301","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,13]]}}}