{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T15:02:39Z","timestamp":1773932559435,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100016176","name":"Science and Technology Postgraduate Education and Research Development Office","doi-asserted-by":"publisher","award":["YJS2026XSJC34"],"award-info":[{"award-number":["YJS2026XSJC34"]}],"id":[{"id":"10.13039\/100016176","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100016176","name":"Science and Technology Postgraduate Education and Research Development Office","doi-asserted-by":"publisher","award":["YJS2024KC32"],"award-info":[{"award-number":["YJS2024KC32"]}],"id":[{"id":"10.13039\/100016176","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006407","name":"Henan Province Natural Science Foundation","doi-asserted-by":"publisher","award":["252300420378"],"award-info":[{"award-number":["252300420378"]}],"id":[{"id":"10.13039\/501100006407","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006407","name":"Henan Province Natural Science Foundation","doi-asserted-by":"publisher","award":["252300421489"],"award-info":[{"award-number":["252300421489"]}],"id":[{"id":"10.13039\/501100006407","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,2]]},"DOI":"10.1016\/j.tcs.2025.115717","type":"journal-article","created":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T00:06:31Z","timestamp":1766189191000},"page":"115717","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Characterization of minimum restricted arc-cuts of unidirectional hypercubes"],"prefix":"10.1016","volume":"1064","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1215-3616","authenticated-orcid":false,"given":"Xiaohui","family":"Hua","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-6191-2159","authenticated-orcid":false,"given":"Rui","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.tcs.2025.115717_bib0001","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1109\/TR.1986.4335424","article-title":"Synthesis of reliable networks-a survey","volume":"35","author":"Boesch","year":"1986","journal-title":"IEEE Trans. Reliab."},{"issue":"1","key":"10.1016\/j.tcs.2025.115717_bib0002","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1002\/net.21462","article-title":"On the super-restricted arc-connectivity of s-geodetic digraphs","volume":"61","author":"Balbuena","year":"2013","journal-title":"Networks"},{"key":"10.1016\/j.tcs.2025.115717_bib0003","series-title":"Digraphs: theory, algorithms and applications","volume":"12","author":"Bang-Jensen","year":"2010"},{"key":"10.1016\/j.tcs.2025.115717_bib0004","doi-asserted-by":"crossref","DOI":"10.1142\/S0129626423500081","article-title":"The super restricted edge-connectedness of direct product graphs","volume":"33","author":"Bai","year":"2023","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/j.tcs.2025.115717_bib0005","series-title":"Proc. Supercomputing 90","first-page":"254","article-title":"Uni-directional hypercubes","author":"Chou","year":"1990"},{"key":"10.1016\/j.tcs.2025.115717_bib0006","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1080\/00207160.2011.638978","article-title":"Component connectivity of the hypercubes","volume":"89","author":"Hsu","year":"2012","journal-title":"Int. J. Comput. Math."},{"key":"10.1016\/j.tcs.2025.115717_bib0007","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/j.ipl.2015.01.006","article-title":"On hamiltonian properties of unidirectional hypercubes","volume":"115","author":"Hung","year":"2015","journal-title":"Inform. Process. Lett"},{"key":"10.1016\/j.tcs.2025.115717_bib0008","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/(SICI)1097-0037(199812)32:4<307::AID-NET7>3.0.CO;2-5","article-title":"On container length and connectivity in unidirectional hypercubes","volume":"32","author":"Jwo","year":"1998","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.tcs.2025.115717_bib0009","first-page":"529","article-title":"Restricted arc connectivity of unidirectional hypercubes and unidirectional folded hypercubes","volume":"23","author":"Lin","year":"2018","journal-title":"Taiwanese J. Math."},{"key":"10.1016\/j.tcs.2025.115717_bib0010","doi-asserted-by":"crossref","first-page":"75","DOI":"10.11650\/twjm\/1500407401","article-title":"On container length and wide-diameter in unidirectional hypercubes","volume":"6","author":"Lu","year":"2002","journal-title":"Taiwanese J. Math."},{"issue":"15","key":"10.1016\/j.tcs.2025.115717_bib0011","article-title":"The 1-good-neighbor diagnosability of unidirectional hypercubes under the PMC model","volume":"375","author":"Lin","year":"2020","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.tcs.2025.115717_bib0012","doi-asserted-by":"crossref","first-page":"1385","DOI":"10.1016\/j.disc.2013.02.011","article-title":"S\u02c7PLXpacapan, A characterization of the edge connectivity of direct products of graphs","volume":"313","year":"2013","journal-title":"Discret. Math"},{"issue":"3","key":"10.1016\/j.tcs.2025.115717_bib0013","doi-asserted-by":"crossref","first-page":"2087","DOI":"10.1007\/s40840-019-00792-y","article-title":"Characterizations of optimal component cuts of locally twisted cubes","volume":"43","author":"Shang","year":"2020","journal-title":"Bull. Malays. Math. Sci. Soc"},{"issue":"7","key":"10.1016\/j.tcs.2025.115717_bib0014","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1109\/12.2234","article-title":"Topological properties of hypercubes","volume":"37","author":"Saad","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.tcs.2025.115717_bib0015","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.ipl.2007.04.004","article-title":"Restricted arc-connectivity of digraphs","volume":"103","author":"Volkmann","year":"2007","journal-title":"Inform. Process. Lett."},{"issue":"6","key":"10.1016\/j.tcs.2025.115717_bib0016","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1016\/j.ipl.2008.07.008","article-title":"\u03bb\u2032-Optimal digraphs","volume":"108","author":"Wang","year":"2008","journal-title":"Inform. Process. Lett."},{"issue":"9","key":"10.1016\/j.tcs.2025.115717_bib0017","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1093\/comjnl\/bxy115","article-title":"Characterizations of minimum structure and substructure-cuts of hypercubes","volume":"62","author":"Yang","year":"2019","journal-title":"Comput. J"},{"key":"10.1016\/j.tcs.2025.115717_bib0018","doi-asserted-by":"crossref","first-page":"9157","DOI":"10.1007\/s11227-022-05036-8","article-title":"On structure and substructure fault tolerance of star networks","volume":"79","author":"Yang","year":"2023","journal-title":"J. Supercomput."},{"issue":"2","key":"10.1016\/j.tcs.2025.115717_bib0019","doi-asserted-by":"crossref","first-page":"304","DOI":"10.3390\/sym14020304","article-title":"Super vertex (edge)-connectivity of varietal hypercube","volume":"14","author":"Yu","year":"2022","journal-title":"Symmetry"},{"key":"10.1016\/j.tcs.2025.115717_bib0020","doi-asserted-by":"crossref","first-page":"1248","DOI":"10.1016\/j.dam.2011.12.004","article-title":"Super restricted edge-connectivity of regular edge-transitive graphs","volume":"160","author":"Zhou","year":"2012","journal-title":"Discrete Appl. Math."},{"issue":"10","key":"10.1016\/j.tcs.2025.115717_bib0021","doi-asserted-by":"crossref","first-page":"2152","DOI":"10.1080\/00207160.2014.883069","article-title":"Arc fault tolerance of cartesian product digraphs on hyper arc connectivity","volume":"91","author":"Zhang","year":"2014","journal-title":"Int. J. Comput. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397525006541?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397525006541?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T12:32:09Z","timestamp":1773923529000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397525006541"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":21,"alternative-id":["S0304397525006541"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2025.115717","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Characterization of minimum restricted arc-cuts of unidirectional hypercubes","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2025.115717","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 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":"115717"}}