{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T01:13:38Z","timestamp":1778634818345,"version":"3.51.4"},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12561063"],"award-info":[{"award-number":["12561063"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1016\/j.tcs.2025.115700","type":"journal-article","created":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T03:08:24Z","timestamp":1765422504000},"page":"115700","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Reliability analysis of the quinary n-cube networks with non-lexicographic order optimal solution of the edge isoperimetric problem"],"prefix":"10.1016","volume":"1065","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-4193-7188","authenticated-orcid":false,"given":"Fengqin","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2621-9022","authenticated-orcid":false,"given":"Mingzu","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4526-7983","authenticated-orcid":false,"given":"Eddie","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.tcs.2025.115700_bib0001","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/TR.2023.3294929","article-title":"Structure fault-tolerant hamiltonian cycle and path embeddings in bipartite k-ary n-cube networks","volume":"73","author":"Sabir","year":"2024","journal-title":"IEEE Trans. Reliab."},{"key":"10.1016\/j.tcs.2025.115700_bib0002","article-title":"Fault tolerability evaluation for the component edge-connectivity of folded Petersen networks","volume":"473","author":"Xu","year":"2024","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"10.1016\/j.tcs.2025.115700_bib0003","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/0112012","article-title":"Optimal assignments of numbers to vertices","volume":"12","author":"Harper","year":"1964","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"10.1016\/j.tcs.2025.115700_bib0004","first-page":"1770","article-title":"Reliability evaluation of generalized K4-Hypercubes based on five link fault patterns","volume":"13","author":"Cheng","year":"2026","journal-title":"IEEE Trans. Reliab."},{"issue":"1","key":"10.1016\/j.tcs.2025.115700_bib0005","doi-asserted-by":"crossref","first-page":"2487","DOI":"10.1109\/TR.2024.3410526","article-title":"A novel links fault tolerant analysis: g-good r-component edge-connectivity of interconnection networks with applications to hypercubes","volume":"74","author":"Liu","year":"2025","journal-title":"IEEE Trans. Reliab."},{"key":"10.1016\/j.tcs.2025.115700_bib0006","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/j.dam.2024.05.036","article-title":"The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree","volume":"356","author":"Qiao","year":"2024","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2025.115700_bib0007","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.dam.2025.06.043","article-title":"Edge isoperimetric method for link fault tolerance of the complete Josephus cube under five models: a unified approach","volume":"378","author":"Yang","year":"2026","journal-title":"Descrete Appl. Math."},{"key":"10.1016\/j.tcs.2025.115700_bib0008","series-title":"Technical Report","article-title":"Edge isopermetric problem on graphs and the related applications, Xia-Men","author":"Zhang","year":"2018"},{"key":"10.1016\/j.tcs.2025.115700_bib0009","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.tcs.2025.115700_bib0010","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/BF01275667","article-title":"Edge-isoperimetric inequalities in the grid","volume":"11","author":"Bollob\u00e1s","year":"1991","journal-title":"Combinatorica"},{"issue":"1\u20133","key":"10.1016\/j.tcs.2025.115700_bib0011","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/S0012-365X(01)00101-7","article-title":"The exact isoperimetric inequality for ternary and quaternary cubes","volume":"244","author":"Slivnik","year":"2002","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2025.115700_bib0012","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s000260050003","article-title":"Els\u00e4sser, an edge-isoperimetric problem for powers of the petersen graph","volume":"4","author":"Bezrukov","year":"2000","journal-title":"Ann. Comb."},{"issue":"1\u20133","key":"10.1016\/j.tcs.2025.115700_bib0013","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0012-365X(01)00432-0","article-title":"The edge-isoperimetric problem for discrete tori","volume":"254","author":"Carlson","year":"2002","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2025.115700_bib0014","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1006\/eujc.1996.0106","article-title":"General edge-isoperimetric inequalities, Part II: a local-global principle for lexicographic solution","volume":"18","author":"Ahlswede","year":"1997","journal-title":"Eur. J. Comb."},{"issue":"1","key":"10.1016\/j.tcs.2025.115700_bib0015","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","article-title":"Zur allgemeinen kurventheorie","volume":"10","author":"Menger","year":"1927","journal-title":"Fund. Math."},{"issue":"3","key":"10.1016\/j.tcs.2025.115700_bib0016","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":"1\u20133","key":"10.1016\/j.tcs.2025.115700_bib0017","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0012-365X(94)00369-T","article-title":"On the extra connectivity of graphs","volume":"155","author":"F\u00e0brega","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2025.115700_bib0018","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.tcs.2016.12.006","article-title":"On the complexity of computing the k-restricted edge-connectivity of a graph","volume":"662","author":"Montejano","year":"2017","journal-title":"Theor. Comput. Sci."},{"issue":"16-17","key":"10.1016\/j.tcs.2025.115700_bib0019","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":"Discrete Appl. Math."},{"issue":"21-22","key":"10.1016\/j.tcs.2025.115700_bib0020","doi-asserted-by":"crossref","first-page":"1202","DOI":"10.1016\/j.ipl.2009.08.005","article-title":"The restricted arc connectivity of cartesian product digraphs","volume":"109","author":"Chen","year":"2009","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"10.1016\/j.tcs.2025.115700_bib0021","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0020-0190(88)90025-7","article-title":"On computing a conditional edge-connectivity of a graph","volume":"27","author":"Esfahanian","year":"1988","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.tcs.2025.115700_bib0022","first-page":"542","article-title":"On super 3-restricted edge connectivity of regular strong product graphs with girth at least four","volume":"1","author":"Qin","year":"2010","journal-title":"Int. Conf. Netw. Digit. Soc."},{"key":"10.1016\/j.tcs.2025.115700_bib0023","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. Parallel Distrib. Comput."},{"key":"10.1016\/j.tcs.2025.115700_bib0024","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.tcs.2025.115700_bib0025","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."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397525006371?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397525006371?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T00:39:47Z","timestamp":1778632787000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397525006371"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":25,"alternative-id":["S0304397525006371"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2025.115700","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Reliability analysis of the quinary n-cube networks with non-lexicographic order optimal solution of the edge isoperimetric problem","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2025.115700","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115700"}}