{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T20:16:52Z","timestamp":1783455412074,"version":"3.55.0"},"reference-count":24,"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\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271229"],"award-info":[{"award-number":["12271229"]}],"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.130219","type":"journal-article","created":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T21:41:48Z","timestamp":1782855708000},"page":"130219","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On the d-blocker number of k-ary n-cubes"],"prefix":"10.1016","volume":"531","author":[{"given":"Hailun","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Heping","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.amc.2026.130219_bib0001","doi-asserted-by":"crossref","first-page":"4306","DOI":"10.1016\/j.disc.2009.01.006","article-title":"Blockers and transversals","volume":"309","author":"Zenklusen","year":"2009","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2026.130219_bib0002","first-page":"185","article-title":"Perfect-matching preclusion","volume":"174","author":"Brigham","year":"2005","journal-title":"Congr. Numer."},{"key":"10.1016\/j.amc.2026.130219_bib0003","doi-asserted-by":"crossref","first-page":"1936","DOI":"10.1016\/j.dam.2012.03.040","article-title":"Matching preclusion and conditional matching preclusion for regular interconnection networks","volume":"160","author":"Cheng","year":"2012","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.amc.2026.130219_bib0004","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/net.20187","article-title":"Matching preclusion for some interconnection networks","volume":"50","author":"Cheng","year":"2007","journal-title":"Networks"},{"key":"10.1016\/j.amc.2026.130219_bib0005","doi-asserted-by":"crossref","first-page":"1699","DOI":"10.1016\/j.dam.2012.03.014","article-title":"Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products","volume":"160","author":"Cheng","year":"2012","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.amc.2026.130219_bib0006","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.dam.2016.02.001","article-title":"Matching preclusion for vertex-transitive networks","volume":"207","author":"Li","year":"2016","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.amc.2026.130219_bib0007","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.tcs.2012.09.020","article-title":"Matching preclusion for balanced hypercubes","volume":"465","author":"L\u00fc","year":"2012","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.amc.2026.130219_bib0008","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.dam.2017.06.001","article-title":"Matching preclusion for k-ary n-cubes with odd k \u202f\u2265\u202f 3","volume":"229","author":"Hu","year":"2017","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.amc.2026.130219_bib0009","article-title":"Graph Theory","volume":"244","author":"Bondy","year":"2008"},{"key":"10.1016\/j.amc.2026.130219_bib0010","series-title":"Perfect Matchings: A Theory of Matching Covered Graphs","author":"Lucchesi","year":"2024"},{"key":"10.1016\/j.amc.2026.130219_bib0011","series-title":"Cycles and Rays","first-page":"9","article-title":"Decomposition into cycles I: hamilton decompositions","author":"Alspach","year":"1990"},{"key":"10.1016\/j.amc.2026.130219_bib0012","doi-asserted-by":"crossref","first-page":"4555","DOI":"10.1016\/j.disc.2009.02.019","article-title":"On cyclic edge-connectivity of transitive graphs","volume":"309","author":"Wang","year":"2009","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2026.130219_bib0013","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.dam.2012.08.001","article-title":"The k-restricted edge-connectivity of a product of graphs","volume":"161","author":"Balbuena","year":"2013","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.amc.2026.130219_bib0014","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1002\/jgt.20053","article-title":"Sufficient conditions for graphs to be \u03bb\u2032-optimal, super-edge-connected, and maximally edge-connected","volume":"48","author":"Hellwig","year":"2005","journal-title":"J. Graph Theory"},{"issue":"12","key":"10.1016\/j.amc.2026.130219_bib0015","doi-asserted-by":"crossref","first-page":"1775","DOI":"10.1016\/j.dam.2012.03.020","article-title":"Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected","volume":"160","author":"Meierling","year":"2012","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.amc.2026.130219_bib0016","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.ipl.2011.10.012","article-title":"A neighborhood condition for graphs to be maximally k-restricted edge connected","volume":"112","author":"Wang","year":"2012","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.amc.2026.130219_bib0017","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.disc.2005.04.020","article-title":"A proof of an inequality concerning k-restricted edge connectivity","volume":"304","author":"Zhang","year":"2005","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2026.130219_bib0018","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.disc.2004.08.011","article-title":"Super restricted edge-connectivity of vertex-transitive graphs","volume":"289","author":"Wang","year":"2004","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2026.130219_bib0019","first-page":"291","article-title":"3-restricted edge connectivity of vertex transitive graphs","volume":"74","author":"Ou","year":"2005","journal-title":"Ars Combin."},{"issue":"19","key":"10.1016\/j.amc.2026.130219_bib0020","first-page":"2429","article-title":"A bound on 4-restricted edge connectivity of graphs","volume":"307","author":"Ou","year":"2007","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2026.130219_bib0021","doi-asserted-by":"crossref","first-page":"1883","DOI":"10.1007\/s11425-014-4794-2","article-title":"Super s-restricted edge-connectivity of vertex transitive graphs","volume":"57","author":"Sun","year":"2014","journal-title":"Sci. China Math."},{"key":"10.1016\/j.amc.2026.130219_bib0022","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0166-218X(00)00337-1","article-title":"On a kind of restricted edge connectivity of graphs","volume":"117","author":"Meng","year":"2002","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.amc.2026.130219_bib0023","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.dam.2025.09.018","article-title":"The d-blocker number and d-transversal number of hexagonal systems","volume":"380","author":"Wu","year":"2026","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.amc.2026.130219_bib0024","series-title":"Graph Factors and Matching Extensions","author":"Yu","year":"2009"}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300326002717?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300326002717?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T19:43:22Z","timestamp":1783453402000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300326002717"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":24,"alternative-id":["S0096300326002717"],"URL":"https:\/\/doi.org\/10.1016\/j.amc.2026.130219","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":"On the d-blocker number of k-ary n-cubes","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.amc.2026.130219","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":"130219"}}