{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:05Z","timestamp":1759639085656,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_49","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T15:12:41Z","timestamp":1435072361000},"page":"624-631","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bounds for the Super Extra Edge Connectivity of Graphs"],"prefix":"10.1007","author":[{"given":"Chia-Wen","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sun-Yuan","family":"Hsieh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"issue":"1","key":"49_CR1","doi-asserted-by":"publisher","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 Mathematics 256(1), 431\u2013439 (2002)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"49_CR2","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.dam.2012.08.001","volume":"161","author":"C Balbuena","year":"2013","unstructured":"Balbuena, C., Marcote, X.: The k-restricted edge-connectivity of a product of graphs. Discrete Applied Mathematics 161(1), 52\u201359 (2013)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"49_CR3","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0020-0190(88)90025-7","volume":"27","author":"AH Esfahanian","year":"1988","unstructured":"Esfahanian, A.H., Hakimi, S.L.: On computing a conditional edge-connectivity of a graph. Information Processing Letters 27(4), 195\u2013199 (1988)","journal-title":"Information Processing Letters"},{"issue":"1","key":"49_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0012-365X(92)00475-7","volume":"127","author":"J F\u00e0brega","year":"1994","unstructured":"F\u00e0brega, J., Fiol, M.A.: Extraconnectivity of graphs with large girth. Discrete Mathematics 127(1), 163\u2013170 (1994)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"49_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0012-365X(94)00369-T","volume":"155","author":"J F\u00e0brega","year":"1996","unstructured":"F\u00e0brega, J., Fiol, M.A.: On the extraconnectivity of graphs. Discrete Mathematics 155(1), 49\u201357 (1996)","journal-title":"Discrete Mathematics"},{"issue":"4","key":"49_CR6","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/j.dam.2011.10.033","volume":"160","author":"Y Hong","year":"2012","unstructured":"Hong, Y., Meng, J., Zhang, Z.: Edge fault tolerance of graphs with respect to super edge connectivity. Discrete Applied Mathematics 160(4), 579\u2013587 (2012)","journal-title":"Discrete Applied Mathematics"},{"key":"49_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2013.10.021","volume":"520","author":"ZM Hong","year":"2014","unstructured":"Hong, Z.M., Xu, J.M.: Vulnerability of super edge-connected networks. Theoretical Computer Science 520, 75\u201386 (2014)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"49_CR8","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.amc.2008.10.035","volume":"207","author":"M L\u0308u","year":"2009","unstructured":"L\u0308u, M., Chen, G.L., Xu, X.R.: On super edge-connectivity of product graphs. Applied Mathematics and Computation 207(2), 300\u2013306 (2009)","journal-title":"Applied Mathematics and Computation"},{"issue":"1","key":"49_CR9","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0012-365X(02)00675-1","volume":"260","author":"JX Meng","year":"2003","unstructured":"Meng, J.X.: Optimally super-edge-connected transitive graphs. Discrete Mathematics 260(1), 239\u2013248 (2003)","journal-title":"Discrete Mathematics"},{"key":"49_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0166-218X(00)00337-1","volume":"117","author":"JX Meng","year":"2002","unstructured":"Meng, J.X., Ji, Y.H.: On a kind of restricted edge connectivity of graphs. Discrete applied mathematics 117, 183\u2013193 (2002)","journal-title":"Discrete applied mathematics"},{"issue":"1","key":"49_CR11","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/j.disc.2005.10.012","volume":"305","author":"J Ou","year":"2005","unstructured":"Ou, J.: Edge cuts leaving components of order at least m. Discrete mathematics 305(1), 365\u2013371 (2005)","journal-title":"Discrete mathematics"},{"issue":"3","key":"49_CR12","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1002\/net.20173","volume":"49","author":"L Shang","year":"2007","unstructured":"Shang, L., Zhang, H.: Sufficient conditions for graphs to be $$\\lambda ^{\\prime }$$-optimal and super-$$\\lambda ^{\\prime }$$. Networks 49(3), 234\u2013242 (2007)","journal-title":"Networks"},{"issue":"10","key":"49_CR13","doi-asserted-by":"publisher","first-page":"3336","DOI":"10.1016\/j.disc.2008.09.051","volume":"309","author":"L Shang","year":"2009","unstructured":"Shang, L., Zhang, H.: Degree conditions for graphs to be $$\\lambda _3$$-optimal and super-$$\\lambda _3$$. Discrete Mathematics 309(10), 3336\u20133345 (2009)","journal-title":"Discrete Mathematics"},{"key":"49_CR14","doi-asserted-by":"publisher","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. Discrete Mathematics 258, 205\u2013214 (2002)","journal-title":"Discrete Mathematics"},{"issue":"4","key":"49_CR15","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1016\/j.disc.2008.01.037","volume":"309","author":"S Wang","year":"2009","unstructured":"Wang, S., Lin, S., Li, C.: Sufficient conditions for super $$k$$-restricted edge connectivity in graphs of diameter $$2$$. Discrete Mathematics 309(4), 908\u2013919 (2009)","journal-title":"Discrete Mathematics"},{"key":"49_CR16","unstructured":"Xu, J.: Topological structure and analysis of interconnection networks. Springer Publishing Company, Incorporated (2010)"},{"issue":"1","key":"49_CR17","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.disc.2005.04.020","volume":"304","author":"Z Zhang","year":"2005","unstructured":"Zhang, Z., Yuan, J.: A proof of an inequality concerning k-restricted edge connectivity. Discrete mathematics 304(1), 128\u2013134 (2005)","journal-title":"Discrete mathematics"},{"issue":"8","key":"49_CR18","doi-asserted-by":"publisher","first-page":"1618","DOI":"10.1080\/00207160.2013.847182","volume":"91","author":"W Zhao","year":"2014","unstructured":"Zhao, W., Ou, J.: On restricted edge-connectivity of lexicographic product graphs. International Journal of Computer Mathematics 91(8), 1618\u20131626 (2014)","journal-title":"International Journal of Computer Mathematics"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T02:27:59Z","timestamp":1676946479000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}