{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T12:25:14Z","timestamp":1746275114675,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T00:00:00Z","timestamp":1706054400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T00:00:00Z","timestamp":1706054400000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s10878-023-01098-3","type":"journal-article","created":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T15:07:01Z","timestamp":1706108821000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Concentration behavior: 50 percent of h-extra edge connectivity of pentanary n-cube with exponential faulty edges"],"prefix":"10.1007","volume":"47","author":[{"given":"Tengteng","family":"Liang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2621-9022","authenticated-orcid":false,"given":"Mingzu","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Sufang","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,24]]},"reference":[{"issue":"2","key":"1098_CR1","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1093\/comjnl\/bxt142","volume":"58","author":"O Alsaleh","year":"2015","unstructured":"Alsaleh O, Bella B, Hamdaoui B (2015) One-to-many node-disjoint paths routing in dense gaussian networks. Comput J 58(2):173\u2013187","journal-title":"Comput J"},{"key":"1098_CR2","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 MA (1994) Extra connectivity of graphs with large girth. Discrete Math 127:163\u2013170","journal-title":"Discrete Math"},{"key":"1098_CR3","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 MA (1996) On the extra connectivity of graphs. Discrete Math 155:49\u201357","journal-title":"Discrete Math"},{"key":"1098_CR4","first-page":"63","volume":"18","author":"M Kle\u0161\u010d","year":"1999","unstructured":"Kle\u0161\u010d M (1999) The crossing numbers of $$K_{5}\\times P_{n}$$. Tatra Mount Math Publ 18:63\u201368","journal-title":"Tatra Mount Math Publ"},{"key":"1098_CR5","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/12.980015","volume":"51","author":"CN Lai","year":"2002","unstructured":"Lai CN, Chen GH, Duh DR (2002) Constructing one-to-many disjoint paths in folded hypercubes. IEEE Trans Comput 51:33\u201345","journal-title":"IEEE Trans Comput"},{"key":"1098_CR6","doi-asserted-by":"publisher","first-page":"15504","DOI":"10.1007\/s11227-022-04489-1","volume":"78","author":"TT Liang","year":"2022","unstructured":"Liang TT, Zhang MZ, Yang X (2022) Reliability analysis of the pentanary $$n$$-cube based on $$h$$-extra edge-connectivity with a concentration behavior. J Supercomput 78:15504\u201315531","journal-title":"J Supercomput"},{"key":"1098_CR7","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.dam.2016.09.013","volume":"217","author":"XJ Li","year":"2017","unstructured":"Li XJ, Liu B, Ma MJ, Xu JM (2017) Many-to-many disjoint paths in hypercubes with faulty vertices. Discrete Appl Math 217:229\u2013242","journal-title":"Discrete Appl Math"},{"key":"1098_CR8","doi-asserted-by":"publisher","first-page":"2753","DOI":"10.1016\/j.dam.2013.04.009","volume":"161","author":"H Li","year":"2013","unstructured":"Li H, Yang WH (2013) Bounding the size of the subgraph induced by $$m$$ vertices and extra edge-connectivity of hypercubes. Discrete Appl Math 161:2753\u20132757","journal-title":"Discrete Appl Math"},{"key":"1098_CR9","first-page":"445","volume":"28","author":"SX L\u00fc","year":"2008","unstructured":"L\u00fc SX, Huang YQ (2008) On the crossing numbers of $$K_{5}\\times S_{n}$$. J Math Res Expos 28:445\u2013459","journal-title":"J Math Res Expos"},{"key":"1098_CR10","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1142\/S0129054121500301","volume":"32","author":"HZ L\u00fc","year":"2021","unstructured":"L\u00fc HZ, Wu TZ (2021) Unpaired many-to-many disjoint path cover of balanced hypercubes. Int J Found Comput Sci 32:943\u2013956","journal-title":"Int J Found Comput Sci"},{"key":"1098_CR11","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.jpdc.2021.07.020","volume":"158","author":"WH Ma","year":"2021","unstructured":"Ma WH, Zhang MZ, Meng JX, Ma TL (2021) Exponential type of many-to-many edge disjoint paths on ternary $$n$$-cubes. J Parallel Distrib Comput 158:67\u201379","journal-title":"J Parallel Distrib Comput"},{"key":"1098_CR12","first-page":"616","volume":"31","author":"Z Ma","year":"2008","unstructured":"Ma Z, Cai J (2008) The crossing number of $$W_{5}\\times S_{n}$$. Acta Math Appl Sin-E 31:616\u2013623","journal-title":"Acta Math Appl Sin-E"},{"issue":"1","key":"1098_CR13","doi-asserted-by":"publisher","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K Menger","year":"1927","unstructured":"Menger K (1927) Zur allgemeinen Kurventheorie. Fund Math 10(1):96\u2013115","journal-title":"Zur allgemeinen Kurventheorie. Fund Math"},{"key":"1098_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.tcs.2016.12.006","volume":"662","author":"LP Montejano","year":"2017","unstructured":"Montejano LP, Sau I (2017) On the complexity of computing the $$k$$-restricted edge-connectivity of a graph. Theor Comput Sci 662:31\u201339","journal-title":"Theor Comput Sci"},{"key":"1098_CR15","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2022.02.003","volume":"911","author":"RC Niu","year":"2022","unstructured":"Niu RC, Xu M (2022) The unpaired many-to-many $$k$$-disjoint paths in bipartite hypercube-like networks. Theor Comput Sci 911:26\u201340","journal-title":"Theor Comput Sci"},{"key":"1098_CR16","doi-asserted-by":"publisher","first-page":"1741","DOI":"10.1007\/s10878-020-00541-z","volume":"44","author":"YF Sun","year":"2020","unstructured":"Sun YF, Wu CC, Zhang XY, Zhang Z (2020) Computation and algorithm for the minimum $$k$$-edge-connectivity of graphs. J Comb Optim 44:1741\u20131752","journal-title":"J Comb Optim"},{"key":"1098_CR17","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.tcs.2022.04.010","volume":"922","author":"ZX Tian","year":"2022","unstructured":"Tian ZX, Zhang MZ, Feng X (2022) Reliability measure of the $$n$$-th cartesian product of complete graph $$K_{4}$$ on $$h$$-extra edge-connectivity. Theor Comput Sci 922:46\u201360","journal-title":"Theor Comput Sci"},{"key":"1098_CR18","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265921420081","author":"YL Wei","year":"2021","unstructured":"Wei YL, Li RH, Yang WH (2021) The $$g$$-extra edge-connectivity of balanced hypercubes. J Interconnect Netw. https:\/\/doi.org\/10.1142\/S0219265921420081","journal-title":"J Interconnect Netw"},{"key":"1098_CR19","doi-asserted-by":"publisher","first-page":"6739","DOI":"10.1007\/s11227-021-04129-0","volume":"78","author":"LQ Xu","year":"2022","unstructured":"Xu LQ, Zhou SM (2022) An $$O({\\log }_2(N))$$ algorithm for reliability assessment of augmented cubes based on $$h$$-extra edge-connectivity. J Supercomput 78:6739\u20136751","journal-title":"J Supercomput"},{"key":"1098_CR20","doi-asserted-by":"publisher","DOI":"10.3390\/sym14020304","author":"ZC Yu","year":"2022","unstructured":"Yu ZC, Xu LQ, Yin SS, Guo LT (2022) Super vertex (edge)-connectivity of varietal hypercube. Symmetry. https:\/\/doi.org\/10.3390\/sym14020304","journal-title":"Symmetry"},{"key":"1098_CR21","doi-asserted-by":"publisher","first-page":"95382","DOI":"10.1109\/ACCESS.2021.3095370","volume":"9","author":"MZ Zhang","year":"2021","unstructured":"Zhang MZ, Ma WH, Ma TL (2021) Many-to-many disjoint paths in augmented cubes with exponential fault edges. IEEE Access 9:95382\u201395390","journal-title":"IEEE Access"},{"key":"1098_CR22","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.ins.2014.03.125","volume":"279","author":"MZ Zhang","year":"2014","unstructured":"Zhang MZ, Meng JX, Yang WH, Tian YZ (2014) Reliability analysis of bijective connection networks in terms of the extra edge-connectivity. Inform Sci 279:374\u2013382","journal-title":"Inform Sci"},{"key":"1098_CR23","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/s11766-016-3247-9","volume":"31","author":"MZ Zhang","year":"2016","unstructured":"Zhang MZ, Meng JX, Yang WH (2016) On the extra edge-connectivity of hypercubes. Appl Math J Chin Univ 31:198\u2013204","journal-title":"Appl Math J Chin Univ"},{"key":"1098_CR24","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1109\/TR.2017.2779130","volume":"67","author":"MZ Zhang","year":"2018","unstructured":"Zhang MZ, Zhang LZ, Feng X, Lai HJ (2018) An $$O({\\log }_2(N))$$ algorithm for reliability evaluation of $$h$$-extra edge-connectivity of folded hypercubes. IEEE Trans Reliab 67:297\u2013307","journal-title":"IEEE Trans Reliab"},{"key":"1098_CR25","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2015.11.049","volume":"615","author":"MZ Zhang","year":"2016","unstructured":"Zhang MZ, Zhang LZ, Feng X (2016) Reliability measures in relation to the $$h$$-extra edge-connectivity of folded hypercubes. Theor Comput Sci 615:71\u201377","journal-title":"Theor Comput Sci"},{"key":"1098_CR26","first-page":"68","volume-title":"Edge isopermetric problem on graphs and the related applications","author":"MZ Zhang","year":"2018","unstructured":"Zhang MZ (2018) Edge isopermetric problem on graphs and the related applications. University of Xiamen, Xiamen, pp 68\u201377"},{"key":"1098_CR27","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.jpdc.2020.08.009","volume":"147","author":"QF Zhang","year":"2021","unstructured":"Zhang QF, Xu LQ, Yang WH (2021) Reliability analysis of the augmented cubes in terms of the extra edge-connectivity and the component edge-connectivity. J Parallel Distrib Comput 147:124\u2013131","journal-title":"J Parallel Distrib Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01098-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01098-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01098-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T23:13:28Z","timestamp":1710285208000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01098-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,24]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["1098"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01098-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,1,24]]},"assertion":[{"value":"12 December 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"3"}}