{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:42:28Z","timestamp":1743100948355,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319729251"},{"type":"electronic","value":"9783319729268"}],"license":[{"start":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T00:00:00Z","timestamp":1513814400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-72926-8_35","type":"book-chapter","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T17:42:36Z","timestamp":1513791756000},"page":"426-435","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Petersen Graph is Uniformly Most-Reliable"],"prefix":"10.1007","author":[{"given":"Guillermo","family":"Rela","sequence":"first","affiliation":[]},{"given":"Franco","family":"Robledo","sequence":"additional","affiliation":[]},{"given":"Pablo","family":"Romero","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"issue":"12","key":"35_CR1","doi-asserted-by":"publisher","first-page":"1579","DOI":"10.1109\/TCS.1987.1086075","volume":"34","author":"D Bauer","year":"1987","unstructured":"Bauer, D., Boesch, F., Suffel, C., Van Slyke, R.: On the validity of a reduction of reliable network design to a graph extremal problem. IEEE Trans. Circuits Syst. 34(12), 1579\u20131581 (1987)","journal-title":"IEEE Trans. Circuits Syst."},{"issue":"2","key":"35_CR2","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1002\/net.3230150210","volume":"15","author":"D Bauer","year":"1985","unstructured":"Bauer, D., Boesch, F., Suffel, C., Tindell, R.: Combinatorial optimization problems in the analysis and design of probabilistic networks. Networks 15(2), 257\u2013271 (1985)","journal-title":"Networks"},{"key":"35_CR3","series-title":"Encyclopedia of Mathematics and its Applications","volume-title":"Topics in Structural Graph Theory","author":"LW Beineke","year":"2012","unstructured":"Beineke, L.W., Wilson, R.J., Oellermann, O.R.: Topics in Structural Graph Theory. Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (2012)"},{"key":"35_CR4","series-title":"Cambridge Mathematical Library","volume-title":"Algebraic Graph Theory","author":"N Biggs","year":"1993","unstructured":"Biggs, N.: Algebraic Graph Theory. Cambridge Mathematical Library. Cambridge University Press, Cambridge (1993)"},{"issue":"2","key":"35_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/net.3230210204","volume":"21","author":"FT Boesch","year":"1991","unstructured":"Boesch, F.T., Li, X., Suffel, C.: On the existence of uniformly optimally reliable networks. Networks 21(2), 181\u2013194 (1991)","journal-title":"Networks"},{"issue":"2","key":"35_CR6","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/net.20300","volume":"54","author":"FT Boesch","year":"2009","unstructured":"Boesch, F.T., Satyanarayana, A., Suffel, C.L.: A survey of some network reliability analysis and synthesis results. Networks 54(2), 99\u2013107 (2009)","journal-title":"Networks"},{"key":"35_CR7","series-title":"Dover Books on Mathematics","volume-title":"Extremal Graph Theory","author":"B Bollob\u00e1s","year":"2004","unstructured":"Bollob\u00e1s, B.: Extremal Graph Theory. Dover Books on Mathematics. Dover Publications, New York (2004)"},{"issue":"2","key":"35_CR8","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/0095-8956(77)90034-X","volume":"23","author":"FC Bussemake","year":"1977","unstructured":"Bussemake, F.C., Cobeljic, S., Cvetkovic, D.M., Seidel, J.J.: Cubic graphs on $$\\le $$14 vertices. J. Comb. Theor. B 23(2), 234\u2013235 (1977)","journal-title":"J. Comb. Theor. B"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Canale, E., Piccini, J., Robledo, F., Romero, P.: Diameter-constrained reliability: complexity, factorization and exact computation in weak graphs. In: Proceedings of the Latin America Networking Conference on LANC 2014, pp. 1\u20137. ACM, New York (2014)","DOI":"10.1145\/2684083.2684095"},{"issue":"2","key":"35_CR10","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/S0095-8956(81)80028-7","volume":"31","author":"C-S Cheng","year":"1981","unstructured":"Cheng, C.-S.: Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory. J. Comb. Theor. B 31(2), 240\u2013248 (1981)","journal-title":"J. Comb. Theor. B"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Colbourn, C.J.: Reliability issues in telecommunications network planning. In: Telecommunications Network Planning, chap. 9, pp. 135\u2013146. Kluwer Academic Publishers (1999)","DOI":"10.1007\/978-1-4615-5087-7_8"},{"issue":"7","key":"35_CR12","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1073\/pnas.48.7.1142","volume":"48","author":"F Harary","year":"1962","unstructured":"Harary, F.: The maximum connectivity of a graph. Proc. Natl. Acad. Sci. U.S.A. 48(7), 1142\u20131146 (1962)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"35_CR13","series-title":"Australian Mathematical Society Lecture Series","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511662058","volume-title":"The Petersen Graph","author":"DA Holton","year":"1993","unstructured":"Holton, D.A., Sheehan, J.: The Petersen Graph. Australian Mathematical Society Lecture Series. Cambridge University Press, Cambridge (1993)"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1002\/andp.18471481202","volume":"72","author":"G Kirchoff","year":"1847","unstructured":"Kirchoff, G.: \u00dcber die aufl\u00f6sung der gleichungen, auf welche man bei der untersuchung der linearen verteilung galvanischer str\u00f6me gef\u00fchrt wird. Ann. Phys. Chem. 72, 497\u2013508 (1847)","journal-title":"Ann. Phys. Chem."},{"key":"35_CR15","unstructured":"Knuth, D.E.: The Art of Computer Programming: Introduction to Combinatiorial Algorithms and Boolean Functions. Addison-Wesley Series in Computer Science and Information Proceedings. Addison-Wesley, Reading (2008)"},{"key":"35_CR16","unstructured":"Leggett, J.D., Bedrosian, S.D.: On networks with the maximum numbers of trees. In: Proceedings of Eighth Midwest Symposium on Circuit Theory, pp. 1\u20138, June 1965"},{"issue":"1\u20133","key":"35_CR17","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01585735","volume":"46","author":"C Monma","year":"1990","unstructured":"Monma, C., Munson, B.S., Pulleyblank, W.R.: Minimum-weight two-connected spanning networks. Math. Program. 46(1\u20133), 153\u2013171 (1990)","journal-title":"Math. Program."},{"issue":"4","key":"35_CR18","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1002\/net.3230210404","volume":"21","author":"W Myrvold","year":"1991","unstructured":"Myrvold, W., Cheung, K.H., Page, L.B., Perry, J.E.: Uniformly-most reliable networks do not always exist. Networks 21(4), 417\u2013419 (1991)","journal-title":"Networks"},{"issue":"1","key":"35_CR19","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0012-365X(97)00034-4","volume":"179","author":"L Petingi","year":"1998","unstructured":"Petingi, L., Boesch, F., Suffel, C.: On the characterization of graphs with maximum number of spanning trees. Discrete Math. 179(1), 155\u2013166 (1998)","journal-title":"Discrete Math."},{"key":"35_CR20","doi-asserted-by":"crossref","unstructured":"Romero, P.: Building uniformly most-reliable networks by iterative augmentation. In: Proceedings of the 9th International Workshop on Resilient Networks Design and Modeling (RNDM 2017), Alghero, Sardinia, Italy, September 2017 (to appear)","DOI":"10.1109\/RNDM.2017.8093016"},{"issue":"5","key":"35_CR21","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/net.3230240504","volume":"24","author":"G Wang","year":"1994","unstructured":"Wang, G.: A proof of Boesch\u2019s conjecture. Networks 24(5), 277\u2013284 (1994)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72926-8_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:17:13Z","timestamp":1710335833000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-72926-8_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,21]]},"ISBN":["9783319729251","9783319729268"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72926-8_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017,12,21]]},"assertion":[{"value":"21 December 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MOD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Machine Learning, Optimization, and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Volterra","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mod2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.taosciences.it\/mod\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}