{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T17:04:56Z","timestamp":1781197496751,"version":"3.54.1"},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003392","name":"Fujian Provincial Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.amc.2026.130181","type":"journal-article","created":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T00:40:03Z","timestamp":1780447203000},"page":"130181","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Fault tolerability analysis of folded Petersen networks on the basis of l-extra edge-connectivity"],"prefix":"10.1016","volume":"531","author":[{"given":"Liqiong","family":"Xu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mengfan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuemin","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6481-3981","authenticated-orcid":false,"given":"Shuming","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.amc.2026.130181_bib0001","series-title":"Topological Structure and Analysis of Interconnection Networks","author":"Xu","year":"2001"},{"issue":"3","key":"10.1016\/j.amc.2026.130181_bib0002","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1002\/net.3230130303","article-title":"Conditional connectivity","volume":"13","author":"Harary","year":"1983","journal-title":"Networks"},{"issue":"6","key":"10.1016\/j.amc.2026.130181_bib0003","doi-asserted-by":"crossref","first-page":"1594","DOI":"10.1109\/TC.2013.10","article-title":"On 3-extra connectivity and 3-extra edge connectivity of folded hypercubes","volume":"63","author":"Chang","year":"2014","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.amc.2026.130181_bib0004","first-page":"401","article-title":"Fault tolerance of locally twisted cubes","volume":"334","author":"Guo","year":"2018","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.amc.2026.130181_bib0005","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/j.jpdc.2019.12.009","article-title":"Subgraph fault tolerance of distance optimally edge connected hypercubes and folded hypercubes","volume":"138","author":"Guo","year":"2020","journal-title":"J. Parall. Distrib. Comput."},{"key":"10.1016\/j.amc.2026.130181_bib0006","doi-asserted-by":"crossref","first-page":"2753","DOI":"10.1016\/j.dam.2013.04.009","article-title":"Bounding the size of the subgraph induced by M vertices and extra edge-connectivity of hypercubes","volume":"161","author":"Li","year":"2013","journal-title":"Discr. Appl. Math."},{"issue":"4","key":"10.1016\/j.amc.2026.130181_bib0007","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1080\/00207160.2016.1148813","article-title":"On extra connectivity and extra edge-connectivity of balanced hypercubes","volume":"94","author":"L\u00fc","year":"2017","journal-title":"Inter. J. Comput. Math."},{"key":"10.1016\/j.amc.2026.130181_bib0008","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.tcs.2022.04.010","article-title":"Reliability measure of the NTH cartesian product of complete graph K on h-extra edge-connectivity","volume":"922","author":"Tian","year":"2022","journal-title":"Theor. Comput. Sci."},{"issue":"issue","key":"10.1016\/j.amc.2026.130181_bib0009","first-page":"587","article-title":"K-restricted edge connectivity for some interconnection networks","volume":"201","author":"Wang","year":"2008","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.amc.2026.130181_bib0010","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.dam.2020.09.012","article-title":"Reliability measure of multiprocessor system based on enhanced hypercubes","volume":"289","author":"Xu","year":"2021","journal-title":"Discr. Appl. Math."},{"key":"10.1016\/j.amc.2026.130181_bib0011","first-page":"1","article-title":"An O(log(N)) algorithm for reliability assessment of 3-ary N-cubes based on h-extra edge connectivity","volume":"99","author":"Xu","year":"2021","journal-title":"IEEE Trans. Reliab."},{"key":"10.1016\/j.amc.2026.130181_bib0012","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/j.ins.2014.02.081","article-title":"On reliability of the folded hypercubes in terms of the extra edge-connectivity","volume":"272","author":"Yang","year":"2014","journal-title":"Inf. Sci."},{"issue":"10","key":"10.1016\/j.amc.2026.130181_bib0013","doi-asserted-by":"crossref","first-page":"2540","DOI":"10.1109\/TC.2013.128","article-title":"Reliability evaluation of BC networks in terms of the extra vertex- and edge-connectivity","volume":"63","author":"Yang","year":"2014","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.amc.2026.130181_bib0014","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/j.ins.2014.03.125","article-title":"Reliability analysis of bijective connection networks in terms of the extra edge-connectivity","volume":"279","author":"Zhang","year":"2014","journal-title":"Inf. Sci."},{"key":"10.1016\/j.amc.2026.130181_bib0015","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.tcs.2015.11.049","article-title":"Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes","volume":"615","author":"Zhang","year":"2016","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.amc.2026.130181_bib0016","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1109\/TR.2017.2779130","article-title":"An O(log(N)) algorithm for reliability evaluation of h-extra edge-connectivity of folded hypercubes","volume":"67","author":"Zhang","year":"2018","journal-title":"IEEE Trans. Reliab."},{"key":"10.1016\/j.amc.2026.130181_bib0017","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.jpdc.2020.08.009","article-title":"Reliability analysis of the augmented cubes in terms of the extra edge-connectivity and the component edge-connectivity","volume":"147","author":"Zhang","year":"2021","journal-title":"J. Parall. Distrib. Comput."},{"key":"10.1016\/j.amc.2026.130181_bib0018","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1109\/TC.1984.1676437","article-title":"Generalized hypercubes and hyperbus structure for a computer network","volume":"33","author":"Bhuyan","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.amc.2026.130181_bib0019","series-title":"Introduction to Parallel Algorithms and Architecture: Arrays, Trees, Hypercubes","author":"Leighton","year":"1992"},{"key":"10.1016\/j.amc.2026.130181_bib0020","series-title":"Graphs and Applications","first-page":"69","article-title":"The petersen graph","author":"Chartrand","year":"1985"},{"key":"10.1016\/j.amc.2026.130181_bib0021","series-title":"Proceedings of the 1993 International Conference on Parallel Processing, Volumel","first-page":"311","article-title":"The folded petersen network : a new communication-efficient multiprocessor topology","author":"\u00d6hring","year":"1993"},{"issue":"2","key":"10.1016\/j.amc.2026.130181_bib0022","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/71.485505","article-title":"Folded Petersen cube networks: new competitors for the hypercubes","volume":"7","author":"\u00d6hring","year":"1996","journal-title":"IEEE Trans. Parall. Distrib. Syst."},{"key":"10.1016\/j.amc.2026.130181_bib0023","series-title":"Proceeding of 4th Annual Symposium on Computer Architecture","first-page":"105","article-title":"A large scale homogenous full distributed parallel machine","volume":"1","author":"Sullivan","year":"1977"},{"key":"10.1016\/j.amc.2026.130181_bib0024","doi-asserted-by":"crossref","first-page":"4786","DOI":"10.1016\/j.disc.2007.08.058","article-title":"Some topological properties of folded Petersen graph","volume":"308","author":"Tan","year":"2008","journal-title":"Discr. Math."},{"key":"10.1016\/j.amc.2026.130181_bib0025","series-title":"Graph Theory and Combinatorial Biology","first-page":"157","article-title":"Edge isoperimetric problems on graphs","volume":"7","author":"Bezrukov","year":"1999"},{"key":"10.1016\/j.amc.2026.130181_bib0026","series-title":"Graph Theory","author":"Bondy","year":"2008"},{"key":"10.1016\/j.amc.2026.130181_bib0027","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s000260050003","article-title":"An edge-isoperimetric problem for powers of the Petersen graph","volume":"4","author":"Bezrukov","year":"2000","journal-title":"Ann. Combin."}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S009630032600233X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S009630032600233X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T16:24:20Z","timestamp":1781195060000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S009630032600233X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":27,"alternative-id":["S009630032600233X"],"URL":"https:\/\/doi.org\/10.1016\/j.amc.2026.130181","relation":{},"ISSN":["0096-3003"],"issn-type":[{"value":"0096-3003","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Fault tolerability analysis of folded Petersen networks on the basis of l-extra edge-connectivity","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.amc.2026.130181","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"130181"}}