{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:06Z","timestamp":1740122466660,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:00:00Z","timestamp":1557792000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:00:00Z","timestamp":1557792000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s10878-019-00415-z","type":"journal-article","created":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T17:22:52Z","timestamp":1557854572000},"page":"427-441","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Mixed connectivity properties of random graphs and some special graphs"],"prefix":"10.1007","volume":"42","author":[{"given":"Ran","family":"Gu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongtang","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4333-3721","authenticated-orcid":false,"given":"Neng","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,14]]},"reference":[{"key":"415_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1112\/S0025579300003806","volume":"14","author":"LW Beineke","year":"1967","unstructured":"Beineke LW, Harary F (1967) The connectivity function of a graph. Mathematika 14:197\u2013202","journal-title":"Mathematika"},{"key":"415_CR2","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1137\/0134052","volume":"34","author":"FT Boesch","year":"1978","unstructured":"Boesch FT, Chen S (1978) A generalization of line connectivity and optimally invulnerable graphs. SIAM J Appl Math 34:657\u2013665","journal-title":"SIAM J Appl Math"},{"key":"415_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068","volume-title":"Random graphs","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s B (2001) Random graphs. Cambridge University Press, Cambridge"},{"key":"415_CR4","first-page":"35","volume":"28","author":"B Bollob\u00e1s","year":"1986","unstructured":"Bollob\u00e1s B, Thomason A (1986a) Random graphs of small order. Ann Discrete Math 28:35\u201338","journal-title":"Ann Discrete Math"},{"key":"415_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF02579198","volume":"7","author":"B Bollob\u00e1s","year":"1986","unstructured":"Bollob\u00e1s B, Thomason A (1986b) Threshold functions. Combinatorica 7:35\u201338","journal-title":"Combinatorica"},{"key":"415_CR6","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF01375475","volume":"11","author":"Y Egawa","year":"1991","unstructured":"Egawa Y, Kaneko A, Matsumoto M (1991) A mixed version of Menger\u2019s theorem. Combinatorica 11:71\u201374","journal-title":"Combinatorica"},{"key":"415_CR7","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s P, R\u00e9nyi A (1959) On random graphs. Publ. Math. Debrecen 6:290\u2013297","journal-title":"Publ. Math. Debrecen"},{"issue":"1","key":"415_CR8","first-page":"261","volume":"12","author":"P Erd\u0151s","year":"1961","unstructured":"Erd\u0151s P, R\u00e9nyi A (1961) On the strength of connectedness of a random graph. Acta Math Hung 12(1):261\u2013267","journal-title":"Acta Math Hung"},{"key":"415_CR9","unstructured":"Erves R, Zeronnik J (2010) Mixed connectivity of Cartesian graph products and bundles. arXiv:1002.2508"},{"key":"415_CR10","doi-asserted-by":"publisher","first-page":"2993","DOI":"10.1090\/S0002-9939-96-03732-X","volume":"124","author":"E Friedgut","year":"1996","unstructured":"Friedgut E, Kalai G (1996) Every monotone graph property has a sharp threshold. Proc Am Math Soc 124:2993\u20133002","journal-title":"Proc Am Math Soc"},{"key":"415_CR11","doi-asserted-by":"crossref","unstructured":"Gu R, Shi Y, Fan N (2017) Mixed connectivity of random graphs. In: Gao X, et al (eds) Combinatorial optimization and applications. Lecture notes in computer science, vol 10627, pp 133\u2013140","DOI":"10.1007\/978-3-319-71150-8_13"},{"key":"415_CR12","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1002\/jgt.10132","volume":"44","author":"K Hennayake","year":"2003","unstructured":"Hennayake K, Lai H-J, Li D, Mao J (2003) Minimally $$(k, k)$$-edge-connected graphs. J Graph Theory 44:116\u2013131","journal-title":"J Graph Theory"},{"key":"415_CR13","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1137\/1118052","volume":"18","author":"GI Ivchenko","year":"1973","unstructured":"Ivchenko GI (1973) The strength of connectivity of a random graph. Theory Probab Appl 18:396\u2013403","journal-title":"Theory Probab Appl"},{"key":"415_CR14","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1006\/jctb.2000.1979","volume":"80","author":"A Kaneko","year":"2000","unstructured":"Kaneko A, Ota K (2000) On minimally $$(n, \\lambda )$$-connected graphs. J Comb Theory Ser B 80:156\u2013171","journal-title":"J Comb Theory Ser B"},{"key":"#cr-split#-415_CR15.1","doi-asserted-by":"crossref","unstructured":"Mader W (1979) Connectivity and edge-connectivity in finite graphs. In: Bollob\u00e1s B","DOI":"10.1017\/CBO9780511662133.005"},{"key":"#cr-split#-415_CR15.2","unstructured":"(ed) Surveys in combinatorics. Proceedings of the Seventh British Combinatorial Conference, Cambridge, 1979. London Math. Soc. Lecture Note Series, vol 38. Cambridge University Press, Cambridge, New York, pp 66-95"},{"key":"415_CR16","first-page":"231","volume":"116","author":"OR Oellermann","year":"1996","unstructured":"Oellermann OR (1996) Connectivity and edge-connectivity in graphs: a survey. Congessus Numerantium 116:231\u2013252","journal-title":"Congessus Numerantium"},{"key":"415_CR17","doi-asserted-by":"publisher","unstructured":"Sadeghi E, Fan N (2019) On the survivable network design problem with mixed connectivity requirements. Ann Oper Res. https:\/\/doi.org\/10.1007\/s10479-019-03175-5","DOI":"10.1007\/s10479-019-03175-5"},{"key":"415_CR18","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1137\/1115004","volume":"15","author":"VE Stepanov","year":"1970","unstructured":"Stepanov VE (1970) On the probability of connectedness of a random graph $$G_m(t)$$. Theory Probab Appl 15:55\u201367","journal-title":"Theory Probab Appl"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00415-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-019-00415-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00415-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T15:32:39Z","timestamp":1694878359000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-019-00415-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,14]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["415"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00415-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2019,5,14]]},"assertion":[{"value":"14 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}