{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T08:40:30Z","timestamp":1762504830929},"reference-count":31,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3735,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0166-218x(02)00568-1","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"555-571","source":"Crossref","is-referenced-by-count":6,"title":["Expected value expansions in rooted graphs"],"prefix":"10.1016","volume":"128","author":[{"given":"Alison","family":"Bailey","sequence":"first","affiliation":[]},{"given":"Gary","family":"Gordon","sequence":"additional","affiliation":[]},{"given":"Matthew","family":"Patton","sequence":"additional","affiliation":[]},{"given":"Jennifer","family":"Scancella","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00568-1_BIB1","unstructured":"M. Aivaliotis, A probabilistic approach to network reliability in graph theory, Honors Thesis, Lafayette College, 1998."},{"key":"10.1016\/S0166-218X(02)00568-1_BIB2","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/jgt.1004","article-title":"When bad things happen to good trees","volume":"37","author":"Aivaliotis","year":"2001","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(02)00568-1_BIB3","first-page":"29","article-title":"Pair-connected reliability of a tree and its distance degree sequences","volume":"58","author":"Amin","year":"1987","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(02)00568-1_BIB4","first-page":"43","article-title":"Exact formulas for reliability measures for various classes of graphs","volume":"58","author":"Amin","year":"1987","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(02)00568-1_BIB5","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/net.3230130210","article-title":"Calculating bounds on reachability and connectedness in stochastic networks","volume":"13","author":"Ball","year":"1983","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(02)00568-1_BIB6","first-page":"211","article-title":"On the \u03b2-invariant for graphs","volume":"109","author":"Benashski","year":"1995","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(02)00568-1_BIB7","series-title":"Introduction to Greedoids Matroid Applications","first-page":"284","volume":"Vol. 40","author":"Bj\u00f6rner","year":"1992"},{"key":"10.1016\/S0166-218X(02)00568-1_BIB8","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/net.3230110106","article-title":"Graphs as models of communication network vulnerability","volume":"11","author":"Boesch","year":"1981","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(02)00568-1_BIB9","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0166-218X(88)90065-0","article-title":"Lower bounds on two-terminal network reliability","volume":"21","author":"Brecht","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00568-1_BIB10","series-title":"Statistical Inference","author":"Casella","year":"1990"},{"key":"10.1016\/S0166-218X(02)00568-1_BIB11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","article-title":"Tough graphs and hamiltonian circuits","volume":"5","author":"Chvatel","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00568-1_BIB12","series-title":"The Combinatorics of Network Reliability","author":"Colbourn","year":"1987"},{"key":"10.1016\/S0166-218X(02)00568-1_BIB13","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1137\/0608033","article-title":"Network resilience","volume":"8","author":"Colbourn","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0166-218X(02)00568-1_BIB14","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1287\/opre.41.3.572","article-title":"Delta-wye transformations and the efficient reduction of two-terminal planar graphs","volume":"41","author":"Feo","year":"1993","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(02)00568-1_BIB15","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1006\/aama.1996.0495","article-title":"Interval partitions and the greedoid Tutte polynomial","volume":"18","author":"Gordon","year":"1997","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/S0166-218X(02)00568-1_BIB16","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0012-365X(90)90019-E","article-title":"Generalized activities and the Tutte polynomial","volume":"85","author":"Gordon","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00568-1_BIB17","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1002\/(SICI)1097-0037(199812)32:4<233::AID-NET1>3.0.CO;2-Z","article-title":"Scheduling in broadcast networks","volume":"32","author":"Hall","year":"1998","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(02)00568-1_BIB18","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/S0166-218X(99)00116-X","article-title":"Best second order bounds for two-terminal network reliability with dependent edge failures","volume":"96\/97","author":"Hansen","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00568-1_BIB19","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/net.3230230411","article-title":"Renormalization of two-terminal reliability","volume":"23","author":"Harms","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(02)00568-1_BIB20","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","article-title":"A survey of gossiping and broadcasting in communication networks","volume":"18","author":"Hedetnieme","year":"1988","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(02)00568-1_BIB21","series-title":"Greedoids","author":"Korte","year":"1991"},{"key":"10.1016\/S0166-218X(02)00568-1_BIB22","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1002\/net.3230210404","article-title":"Uniformly-most reliable networks do not always exist","volume":"21","author":"Myrvold","year":"1991","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(02)00568-1_BIB23","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0012-365X(83)90252-2","article-title":"Cohesion and stability in graphs","volume":"46","author":"Ringeisen","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00568-1_BIB24","doi-asserted-by":"crossref","unstructured":"F. Roberts, F. Hwang, C. Monma (Eds.), Reliability of Computer and Communication Networks, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 5, 1991.","DOI":"10.1090\/dimacs\/005"},{"key":"10.1016\/S0166-218X(02)00568-1_BIB25","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1002\/net.3230130107","article-title":"Network reliability and the factoring theorem","volume":"13","author":"Satyanarayana","year":"1983","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(02)00568-1_BIB26","series-title":"Network Reliability and Algebraic Structures","author":"Shier","year":"1991"},{"key":"10.1016\/S0166-218X(02)00568-1_BIB27","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1017\/S0963548398003629","article-title":"Expected value expansions in random subgraphs with applications to network reliability","volume":"7","author":"Siegrist","year":"1993","journal-title":"Combe. Probab. Comput."},{"key":"10.1016\/S0166-218X(02)00568-1_BIB28","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0166-218X(90)90057-J","article-title":"The optimal unicyclic graphs for pair-connected reliability","volume":"41","author":"Siegrist","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00568-1_BIB29","first-page":"95","article-title":"A note on reliability and expected value","volume":"133","author":"Traldi","year":"1998","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(02)00568-1_BIB30","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0012-365X(00)00035-2","article-title":"Series and parallel reductions for the Tutte polynomial","volume":"220","author":"Traldi","year":"2000","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00568-1_BIB31","unstructured":"L. Traldi, Activities for reliability. I, preprint."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02005681?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02005681?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T04:22:36Z","timestamp":1553228556000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02005681"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":31,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0166218X02005681"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00568-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}