{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:51:07Z","timestamp":1758271867286},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2005,12]]},"DOI":"10.1007\/s00373-005-0600-9","type":"journal-article","created":{"date-parts":[[2006,1,30]],"date-time":"2006-01-30T11:48:23Z","timestamp":1138621703000},"page":"459-467","source":"Crossref","is-referenced-by-count":11,"title":["Super Restricted Edge Connectivity of Regular Graphs"],"prefix":"10.1007","volume":"21","author":[{"given":"Ou","family":"Jianping","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fuji","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"600_CR1","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 Comput. 12,777\u2013788 (1983)","journal-title":"SIAM Comput."},{"key":"600_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., et al,: Combinatorial optimization problem in the analysis and design of probabilistic networks. Networks, 15, 257\u2013271 (1985)","journal-title":"Networks"},{"key":"600_CR3","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, H.L.: On computing a conditional edge connectivity of a graph. J. In. Process. Letters, 27, 195\u2013199 (1988)","journal-title":"J. In. Process. Letters"},{"key":"600_CR4","doi-asserted-by":"crossref","first-page":"1586","DOI":"10.1109\/12.42131","volume":"38","author":"A.H. Esfahanian","year":"1989","unstructured":"Esfahanian, A.H.: Generalized measures of fault tolerance with application to N-cube networks. J IEEE Trans. Comput. 38, 1586\u20131591 (1989)","journal-title":"J IEEE Trans. Comput."},{"key":"600_CR5","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":"600_CR6","unstructured":"Wang, Y.Q.: Properies of high order edge connectivity of graphs and network reliability comparison. Ph.D. Thesis, Department of Mathmetics, Shanghai Jiaotong University, China 2001"},{"key":"600_CR7","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0012-365X(01)00232-1","volume":"243","author":"J.M. Xu","year":"2002","unstructured":"Xu, J.M., Xu, K.L.: On restricted edge connectivity of graphs. Discrete Math. 243, 291\u2013298 (2002)","journal-title":"Discrete Math."},{"key":"600_CR8","unstructured":"Li, Q.: On comparison and optimization problems of reliable networks for sufficiently small edge failure probability. private communication"},{"issue":"1\u20133","key":"600_CR9","first-page":"183","volume":"117","author":"J.X. Men","year":"2002","unstructured":"Men, J.X., Ji, Y.: On a kind of restricted edge connectivity of graphs. Discrete Appl. Math. 117(1\u20133), 183\u2013193 (2002)","journal-title":"Discrete Appl. Math."},{"key":"600_CR10","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. Discrete Math. 256, 431\u2013439 (2002)","journal-title":"Discrete Math."},{"key":"600_CR11","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1002\/net.10037","volume":"40","author":"B.S. Shieh","year":"2002","unstructured":"Shieh, B.S.: Super edge- and point-connectivity of the cartesian product of regular graphs. Networks, 40, 91\u201396 (2002)","journal-title":"Networks"},{"key":"600_CR12","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory With Applications, New York: North-Holland 1976","DOI":"10.1007\/978-1-349-03521-2"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-005-0600-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-005-0600-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-005-0600-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-005-0600-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T04:01:58Z","timestamp":1652500918000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-005-0600-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["600"],"URL":"https:\/\/doi.org\/10.1007\/s00373-005-0600-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12]]}}}