{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T12:56:32Z","timestamp":1777812992016,"version":"3.51.4"},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100020595","name":"National Science and Technology Council","doi-asserted-by":"publisher","award":["114-2221-E-141-011"],"award-info":[{"award-number":["114-2221-E-141-011"]}],"id":[{"id":"10.13039\/100020595","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011477","name":"Qinghai Normal University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100011477","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12261074"],"award-info":[{"award-number":["12261074"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12461065"],"award-info":[{"award-number":["12461065"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.dam.2026.02.013","type":"journal-article","created":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T08:23:35Z","timestamp":1771835015000},"page":"293-305","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 hypercubes based on the\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" id=\"d1e391\" altimg=\"si24.svg\">\n                      <mml:mi>g<\/mml:mi>\n                    <\/mml:math>\n                    -cyclic fault pattern"],"prefix":"10.1016","volume":"386","author":[{"given":"Ting","family":"Tian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shumin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jou-Ming","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.02.013_b1","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.tcs.2018.09.018","article-title":"The 4-component connectivity of alternating group networks","volume":"766","author":"Chang","year":"2019","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2026.02.013_b2","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.dam.2021.10.012","article-title":"Reliability assessment for modified bubble-sort network","volume":"307","author":"Chen","year":"2022","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.02.013_b3","series-title":"From Parallel to Emergent Computing","first-page":"77","article-title":"Structural properties and fault resiliency of interconnection networks","author":"Cheng","year":"2019"},{"key":"10.1016\/j.dam.2026.02.013_b4","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1007\/s00373-012-1172-0","article-title":"Cyclic vertex-connectivity of Cayley graphs generated by transposition trees","volume":"29","author":"Cheng","year":"2013","journal-title":"Graphs Combin."},{"key":"10.1016\/j.dam.2026.02.013_b5","first-page":"49","article-title":"On the extra connectivity of graphs","volume":"155","author":"F\u00e0brega","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.02.013_b6","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.dam.2025.07.011","article-title":"Component edge connectivity of folded hypercube-likenetworks","volume":"378","author":"Guo","year":"2026","journal-title":"Discrete Appl. Math."},{"issue":"15","key":"10.1016\/j.dam.2026.02.013_b7","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.dam.2025.02.034","article-title":"Connectivity and super connectivity of enhanced folded hypercube-like networks","volume":"369","author":"Guo","year":"2025","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.02.013_b8","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. Parallel Distrib. Comput."},{"issue":"2","key":"10.1016\/j.dam.2026.02.013_b9","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1142\/S0129054121500076","article-title":"Relation of extra edge connectivity and component edge connectivity for regular networks","volume":"32","author":"Guo","year":"2021","journal-title":"Internat. J. Found. Comput. Sci."},{"issue":"3","key":"10.1016\/j.dam.2026.02.013_b10","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":"2","key":"10.1016\/j.dam.2026.02.013_b11","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.dam.2026.02.013_b12","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1007\/s10878-018-0332-4","article-title":"A polynomial algorithm determining cyclic vertex connectivity of k-regular graphs with fixed k","volume":"37","author":"Liang","year":"2019","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.dam.2026.02.013_b13","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1007\/s10878-019-00400-6","article-title":"A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs","volume":"38","author":"Liang","year":"2019","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.dam.2026.02.013_b14","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1142\/S1793830911001322","article-title":"Cyclic connectivity of star graph","volume":"3","author":"Liu","year":"2011","journal-title":"Discret. Math. Algorithms Appl."},{"key":"10.1016\/j.dam.2026.02.013_b15","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1080\/17445760.2019.1659259","article-title":"Cyclic vertex-connectivity of Cartesian product graphs","volume":"35","author":"Qin","year":"2020","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"key":"10.1016\/j.dam.2026.02.013_b16","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1090\/S0002-9947-1984-0743738-4","article-title":"Minimal cyclic-4-connected graphs","volume":"284","author":"Robertson","year":"1984","journal-title":"Trans. Amer. Math. Soc."},{"issue":"8","key":"10.1016\/j.dam.2026.02.013_b17","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1109\/12.536232","article-title":"On diagnosability of large fault sets in regular topology-based computer systems","volume":"45","author":"Somani","year":"1996","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.dam.2026.02.013_b18","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.tcs.2019.11.021","article-title":"On the g-good-neighbor connectivity of graphs","volume":"804","author":"Wang","year":"2020","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/j.dam.2026.02.013_b19","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1080\/17445760.2019.1618462","article-title":"Component connectivity of cayley graphs generated by transposition trees","volume":"35","author":"Xu","year":"2020","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"issue":"3","key":"10.1016\/j.dam.2026.02.013_b20","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.ipl.2005.10.003","article-title":"Minimum neighborhood in a generalized cube","volume":"97","author":"Yang","year":"2006","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.dam.2026.02.013_b21","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/00207160500113173","article-title":"On the maximal connected component of a hypercube with faulty vertices III","volume":"83","author":"Yang","year":"2006","journal-title":"Int. J. Comput. Math."},{"key":"10.1016\/j.dam.2026.02.013_b22","doi-asserted-by":"crossref","first-page":"1027","DOI":"10.1016\/j.ipl.2010.09.001","article-title":"Conditional connectivity of Cayley graphs generated by transposition trees","volume":"110","author":"Yang","year":"2010","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.dam.2026.02.013_b23","first-page":"189","article-title":"Extraconnectivity of hypercubes (II)","volume":"47","author":"Yang","year":"2010","journal-title":"Australas. J. Comb."},{"key":"10.1016\/j.dam.2026.02.013_b24","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/j.dam.2021.08.029","article-title":"Reliability evaluation of DQcube based on g-good neighbor and g-component fault pattern","volume":"305","author":"Zhang","year":"2021","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.02.013_b25","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.tcs.2016.05.035","article-title":"Component connectivity of hypercubes","volume":"640","author":"Zhao","year":"2016","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2026.02.013_b26","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2023.114253","article-title":"Reliability evaluation for a class of recursive match networks","volume":"981","author":"Zhou","year":"2024","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2026.02.013_b27","article-title":"Fault tolerance of recursive match networks based on g-good-neighbor fault pattern","volume":"461","author":"Zhou","year":"2024","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"10.1016\/j.dam.2026.02.013_b28","first-page":"249","article-title":"On restricted edge connectivity and extra edge connectivity of hypercubes and folded hypercubes","volume":"36","author":"Zhu","year":"2006","journal-title":"J. Univ. Sci. Technol. China"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26000855?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26000855?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T21:08:43Z","timestamp":1777496923000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26000855"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":28,"alternative-id":["S0166218X26000855"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.02.013","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Fault tolerability analysis of hypercubes based on the -cyclic fault pattern","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.02.013","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"}]}}