{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T23:03:49Z","timestamp":1648767829141},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,5,10]],"date-time":"2012-05-10T00:00:00Z","timestamp":1336608000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s00373-012-1182-y","type":"journal-article","created":{"date-parts":[[2012,5,9]],"date-time":"2012-05-09T10:03:43Z","timestamp":1336557823000},"page":"1973-1981","source":"Crossref","is-referenced-by-count":0,"title":["On Edge Cut of Graphs Leaving Components of Order at Least Five"],"prefix":"10.1007","volume":"29","author":[{"given":"Jichang","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianping","family":"Ou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,5,10]]},"reference":[{"key":"1182_CR1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1002\/jgt.20150","volume":"52","author":"C. Balbuena","year":"2006","unstructured":"Balbuena C., Garcia-V\u00e1zquez P., Marcote X.: Sufficient conditions for \u03bb\u2032-optimality in graphs with girth g. J Graph Theory 52, 73\u201386 (2006)","journal-title":"J Graph Theory"},{"key":"1182_CR2","doi-asserted-by":"crossref","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 problem in analysis and design of probabilistic networks. Networks 15, 257\u2013271 (1985)","journal-title":"Networks"},{"key":"1182_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy J.A., Murty U.S.R.: Graph theory with applications. Macmillan Press, London (1976)"},{"key":"1182_CR4","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/S0012-365X(02)00385-0","volume":"256","author":"P. Bonsma","year":"2002","unstructured":"Bonsma P., Ueffing N., Volkmann L.: Edge-cuts leaving components of order at least three. Discret. Math. 256, 431\u2013439 (2002)","journal-title":"Discret. Math."},{"key":"1182_CR5","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0020-0190(88)90025-7","volume":"27","author":"A.H. Esfahanian","year":"1988","unstructured":"Esfahanian A.H., Hakimi S.L.: On computing a conditional edge connectivity of a graph. Inform Proc Lett 27, 195\u2013199 (1988)","journal-title":"Inform Proc Lett"},{"key":"1182_CR6","doi-asserted-by":"crossref","first-page":"3265","DOI":"10.1016\/j.disc.2007.06.035","volume":"308","author":"A. Hellwig","year":"2008","unstructured":"Hellwig A., Volkmann L.: Maximally edge-connected and vertex-connected graphs and digraphs. Discret Math 308, 3265\u20133296 (2008)","journal-title":"Discret Math"},{"key":"1182_CR7","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1016\/j.aml.2007.09.004","volume":"21","author":"Y.M. Hong","year":"2008","unstructured":"Hong Y.M., Liu Q.H., Zhang Z.: Minimally restricted edge connected graphs. Appl Math Lett 21, 820\u2013823 (2008)","journal-title":"Appl Math Lett"},{"key":"1182_CR8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/(SICI)1097-0037(199803)31:2<61::AID-NET1>3.0.CO;2-H","volume":"28","author":"Q.L. Li","year":"1998","unstructured":"Li Q.L., Li Q.: Reliability analysis of circulant graphs. Networks 28, 61\u201365 (1998)","journal-title":"Networks"},{"key":"1182_CR9","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0016-0032(56)90559-2","volume":"262","author":"E.F. Moore","year":"1956","unstructured":"Moore E.F., Shannon C.: Reliable circuits using less reliable relays (I). J Franklin Inst 262, 191\u2013208 (1956)","journal-title":"J Franklin Inst"},{"key":"1182_CR10","doi-asserted-by":"crossref","first-page":"3149","DOI":"10.1080\/00207160903165416","volume":"87","author":"J.P. Ou","year":"2010","unstructured":"Ou J.P.: On maximal 3-restricted edge connectivity of regular graphs. Int J Comput Math 87, 3149\u20133156 (2010)","journal-title":"Int J Comput Math"},{"key":"1182_CR11","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/j.disc.2005.10.012","volume":"305","author":"J.P. Ou","year":"2005","unstructured":"Ou J.P.: Edges cuts leaving components of order at least m. Discret. Math. 305, 365\u2013371 (2005)","journal-title":"Discret. Math."},{"key":"1182_CR12","first-page":"103","volume":"30","author":"J.P. Ou","year":"2004","unstructured":"Ou J.P.: 4-restricted edge cut of graphs. Australas J Combinatorics 30, 103\u2013112 (2004)","journal-title":"Australas J Combinatorics"},{"key":"1182_CR13","doi-asserted-by":"crossref","first-page":"2429","DOI":"10.1016\/j.disc.2006.10.016","volume":"307","author":"J.P. Ou","year":"2007","unstructured":"Ou J.P.: A bound on 4-restricted edge connectivity of graphs. Discret. Math. 307, 2429\u20132437 (2007)","journal-title":"Discret. Math."},{"key":"1182_CR14","unstructured":"Ou J.P.: Restricted edge connectivity of graphs and reliability of networks. PhD Thesis, Department of Mathematics, Xiamen University, China (2003)"},{"key":"1182_CR15","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1137\/0212053","volume":"12","author":"J.S. Provan","year":"1983","unstructured":"Provan J.S., Ball M.O.: The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J Comput 12, 777\u2013788 (1983)","journal-title":"SIAM J Comput"},{"key":"1182_CR16","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0012-365X(02)00299-6","volume":"258","author":"M. Wang","year":"2002","unstructured":"Wang M., Li Q.: Conditional edge connectivity properties reliability comparison and transitivity of graphs. Discret. Math. 258, 205\u2013214 (2002)","journal-title":"Discret. Math."},{"key":"1182_CR17","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1109\/31.7582","volume":"35","author":"C.S. Yang","year":"1988","unstructured":"Yang C.S., Wang J.F., Lee J.Y., Boesch F.T.: Graph theoretic reliability analysis for the Boolean n-cube networks. IEEE Trans Circuits Syst 35, 1175\u20131179 (1988)","journal-title":"IEEE Trans Circuits Syst"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1182-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1182-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1182-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:33Z","timestamp":1559055573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1182-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,10]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["1182"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1182-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,10]]}}}