{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T09:44:57Z","timestamp":1776419097761,"version":"3.51.2"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"13","license":[{"start":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T00:00:00Z","timestamp":1650240000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T00:00:00Z","timestamp":1650240000000},"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 Supercomput"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s11227-022-04489-1","type":"journal-article","created":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T17:05:55Z","timestamp":1650301555000},"page":"15504-15531","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Reliability analysis of the pentanary n-cube based on h-extra edge-connectivity with a concentration behavior"],"prefix":"10.1007","volume":"78","author":[{"given":"Tengteng","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingzu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xing","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,18]]},"reference":[{"key":"4489_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.ins.2013.10.031","volume":"276","author":"M Abd-El-Barr","year":"2014","unstructured":"Abd-El-Barr M, Gebali F (2014) Reliability analysis and fault tolerance for hypercube multi-computer networks. Inf Sci 276:295\u2013318","journal-title":"Inf Sci"},{"issue":"1","key":"4489_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 (2013) The $$k$$-restricted edge-connectivity of a product of graphs. Discret Appl Math 161(1):52\u201359","journal-title":"Discret Appl Math"},{"issue":"6","key":"4489_CR3","doi-asserted-by":"publisher","first-page":"1594","DOI":"10.1109\/TC.2013.10","volume":"63","author":"N-W Chang","year":"2014","unstructured":"Chang N-W, Tsai C-Y, Hsieh S-Y (2014) On 3-extra connectivity and 3-extra edge connectivity of folded hypercubes. IEEE Trans Comput 63(6):1594\u20131600","journal-title":"IEEE Trans Comput"},{"issue":"21\u201322","key":"4489_CR4","doi-asserted-by":"publisher","first-page":"1202","DOI":"10.1016\/j.ipl.2009.08.005","volume":"109","author":"X Chen","year":"2009","unstructured":"Chen X, Liu J, Meng JX (2009) The restricted arc connectivity of cartesian product digraphs. Inf Process Lett 109(21\u201322):1202\u20131205","journal-title":"Inf Process Lett"},{"key":"4489_CR5","doi-asserted-by":"crossref","unstructured":"F$$\\grave{a}$$brega J, Fiol MA (1994) Extra connectivity of graphs with large girth. Discrete Math 127(1\u20133):163\u2013170","DOI":"10.1016\/0012-365X(92)00475-7"},{"key":"4489_CR6","doi-asserted-by":"crossref","unstructured":"F$$\\grave{a}$$brega J, Fiol MA (1996) On the extra connectivity of graphs. Discrete Math 155(1\u20133):49\u201357","DOI":"10.1016\/0012-365X(94)00369-T"},{"issue":"3","key":"4489_CR7","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0045-7906(99)00003-8","volume":"25","author":"SA Ghozati","year":"1999","unstructured":"Ghozati SA, Wasserman HC (1999) The $$k$$-ary $$n$$-cube network: modeling, topological properties and routing strategies. Comput Electr Eng 25(3):155\u2013168","journal-title":"Comput Electr Eng"},{"issue":"2","key":"4489_CR8","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1142\/S0129054121500076","volume":"32","author":"LT Guo","year":"2021","unstructured":"Guo LT, Zhang MZ, Zhai SH, Xu LQ (2021) Relation of extra edge connectivity and component edge connectivity for regular networks. Int J Found Comput Sci 32(2):137\u2013149","journal-title":"Int J Found Comput Sci"},{"issue":"3","key":"4489_CR9","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1002\/net.3230130303","volume":"13","author":"F Harary","year":"1983","unstructured":"Harary F (1983) Conditional connectivity. Networks 13(3):347\u2013357","journal-title":"Networks"},{"key":"4489_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2013.10.008","volume":"513","author":"S Jo","year":"2013","unstructured":"Jo S, Park J-H, Chwa K-Y (2013) Paired many-to-many disjoint path covers in faulty hypercubes. Theoret Comput Sci 513:1\u201324","journal-title":"Theoret Comput Sci"},{"key":"4489_CR11","doi-asserted-by":"crossref","unstructured":"Kle$$\\check{s}\\check{c}$$ M (2001) The crossing numbers of cartesian products of paths with 5-vertex graphs. Discrete Math 233(1\u20133):353\u2013359","DOI":"10.1016\/S0012-365X(00)00251-X"},{"key":"4489_CR12","doi-asserted-by":"crossref","unstructured":"Kle$$\\check{s}\\check{c}$$ M (2001) On the crossing numbers of products of stars and graphs of order five. Graphs Combinatorics 17:289\u2013294","DOI":"10.1007\/s003730170042"},{"key":"4489_CR13","unstructured":"Kle$$\\check{s}\\check{c}$$ M (1999) The crossing numbers of $$K_{5}\\times P_{n}$$. Tatra Mountains Mathematical Publications 18:63\u201368"},{"key":"4489_CR14","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. Discret Appl Math 161:2753\u20132757","journal-title":"Discret Appl Math"},{"issue":"8","key":"4489_CR15","doi-asserted-by":"publisher","first-page":"1939","DOI":"10.1109\/TPDS.2021.3133595","volume":"33","author":"X-Y Li","year":"2021","unstructured":"Li X-Y, Lin W, Liu X, Lin C-K, Pai K-J, Chang J-M (2021) Completely independent spanning trees on BCCC data center networks with an application to fault-tolerant routing. IEEE Trans Parallel Distrib Syst 33(8):1939\u20131952","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"4489_CR16","doi-asserted-by":"publisher","unstructured":"Liu XM, Meng JX (2021) The $$k$$-restricted edge-connectivity of the data center network DCell. Appl Math Comput 396. https:\/\/doi.org\/10.1016\/j.amc.2020.125941","DOI":"10.1016\/j.amc.2020.125941"},{"issue":"2","key":"4489_CR17","first-page":"300","volume":"207","author":"M L\u00fc","year":"2009","unstructured":"L\u00fc M, Chen G-L, Xu X-R (2009) On super edge-connectivity of product graphs. Appl Math Comput 207(2):300\u2013306","journal-title":"Appl Math Comput"},{"key":"4489_CR18","unstructured":"L$$\\ddot{u}$$ SX, Huang YQ (2008) On the crossing numbers of $$K_{5}\\times S_{n}$$. J Math Res Exposition 28(3):445\u2013459"},{"key":"4489_CR19","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. Theoret Comput Sci 662:31\u201339","journal-title":"Theoret Comput Sci"},{"key":"4489_CR20","unstructured":"Qin YY, Xiong ZP, Wang JY (2010) On super 3-restricted edge connectivity of regular strong product graphs with girth at least four. In: International Conference on Networking and Digital Society, vol 1, pp 542\u2013544"},{"key":"4489_CR21","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.2348","author":"JB Saraf","year":"2020","unstructured":"Saraf JB, Borse YM, Mundhe G (2020) On conditional connectivity of the cartesian product of cycles. Discuss Math Graph Theory. https:\/\/doi.org\/10.7151\/dmgt.2348","journal-title":"Discuss Math Graph Theory"},{"key":"4489_CR22","doi-asserted-by":"publisher","unstructured":"Wei YL, Li R-H, Yang WH (2021) The $$g$$-extra edge-connectivity of balanced hypercubes. J Interconnection Netw 21(4). https:\/\/doi.org\/10.1142\/S0219265921420081","DOI":"10.1142\/S0219265921420081"},{"key":"4489_CR23","doi-asserted-by":"publisher","unstructured":"Xu LQ, Zhou SM (2021) An $$O({\\log }_2(N))$$ algorithm for reliability assessment of augmented cubes based on $$h$$-extra edge-connectivity. J Supercomput,1\u201313. https:\/\/doi.org\/10.1007\/s11227-021-04129-0","DOI":"10.1007\/s11227-021-04129-0"},{"key":"4489_CR24","first-page":"203","volume":"2","author":"JM Xu","year":"2005","unstructured":"Xu JM, Zhu Q, Hou MX, Zhou T (2005) On restricted edge connectivity and extra edge connectivity of hypercubes and folded hypercubes. J Shanghai Jiaotong Univ (Chin Ed) 2:203\u2013207","journal-title":"J Shanghai Jiaotong Univ (Chin Ed)"},{"issue":"10","key":"4489_CR25","doi-asserted-by":"publisher","first-page":"2540","DOI":"10.1109\/TC.2013.128","volume":"63","author":"WH Yang","year":"2014","unstructured":"Yang WH, Li HQ (2014) Reliability evaluation of BC networks in terms of the extra vertex- and edge-connectivity. IEEE Trans Comput 63(10):2540\u20132548","journal-title":"IEEE Trans Comput"},{"key":"4489_CR26","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.ins.2014.02.081","volume":"272","author":"WH Yang","year":"2014","unstructured":"Yang WH, Li H (2014) On reliability of the folded hypercubes in terms of the extra edge-connectivity. Inf Sci 272:238\u2013243","journal-title":"Inf Sci"},{"issue":"9","key":"4489_CR27","doi-asserted-by":"publisher","first-page":"2884","DOI":"10.1109\/TC.2015.2506562","volume":"65","author":"L-C Ye","year":"2016","unstructured":"Ye L-C, Liang J-R, Lin H-X (2016) A fast pessimistic diagnosis algorithm for hypercube-like networks under the comparison model. IEEE Trans Comput 65(9):2884\u20132888","journal-title":"IEEE Trans Comput"},{"key":"4489_CR28","doi-asserted-by":"publisher","unstructured":"Yu ZC, Xu LQ, Yin SS, Guo LT (2022) Super vertex (edge)-connectivity of varietal hypercube. Symmetry 14(2). https:\/\/doi.org\/10.3390\/sym14020304","DOI":"10.3390\/sym14020304"},{"key":"4489_CR29","doi-asserted-by":"publisher","first-page":"26478","DOI":"10.1109\/ACCESS.2020.2971274","volume":"8","author":"QF Zhang","year":"2020","unstructured":"Zhang QF, Xu LQ, Zhou SM, Guo LT (2020) Reliability analysis of subsystem in balanced hypercubes. IEEE Access 8:26478\u201326486","journal-title":"IEEE Access"},{"key":"4489_CR30","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"},{"issue":"3","key":"4489_CR31","first-page":"249","volume":"36","author":"Q Zhu","year":"2006","unstructured":"Zhu Q, Xu JM (2006) On restricted edge connectivity and extra edge connectivity of hypercubes and folded hypercubes. J Univ Sci Technol China 36(3):249\u2013253","journal-title":"J Univ Sci Technol China"},{"key":"4489_CR32","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. Inf Sci 279:374\u2013382","journal-title":"Inf Sci"},{"key":"4489_CR33","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":"4489_CR34","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":"4489_CR35","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. Theoret Comput Sci 615:71\u201377","journal-title":"Theoret Comput Sci"},{"issue":"8","key":"4489_CR36","doi-asserted-by":"publisher","first-page":"1618","DOI":"10.1080\/00207160.2013.847182","volume":"91","author":"WS Zhao","year":"2013","unstructured":"Zhao WS, Ou JP (2013) On restricted edge-connectivity of lexicographic product graphs. Int J Comput Math 91(8):1618\u20131626","journal-title":"Int J Comput Math"},{"key":"4489_CR37","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s00373-007-0726-z","volume":"23","author":"WP Zheng","year":"2007","unstructured":"Zheng WP, Lin XH, Yang YS, Cui C (2007) On the crossing number of $$K_{m}\\times P_{n}$$. Graphs Combinatorics 23:327\u2013336","journal-title":"Graphs Combinatorics"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04489-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04489-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04489-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,8]],"date-time":"2022-08-08T15:14:24Z","timestamp":1659971664000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04489-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,18]]},"references-count":37,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["4489"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04489-1","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,18]]},"assertion":[{"value":"26 March 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}