{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T18:44:31Z","timestamp":1768675471407,"version":"3.49.0"},"reference-count":24,"publisher":"Oxford University Press (OUP)","issue":"7","license":[{"start":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T00:00:00Z","timestamp":1620691200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772010"],"award-info":[{"award-number":["61772010"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,7,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>The (conditional) matching preclusion number of a graph is the minimum number of edges whose deletion leaves the resulting graph (with no isolated vertices) that has neither perfect matchings nor almost perfect matchings. The (conditional) strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion makes the resulting graph (with no isolated vertices) without perfect matching or almost perfect matching. The enhanced hypercube $Q_{n,k}$ \u00a0$(1\\leq k\\leq n-1)$ is an extension of hypercube. In this paper, we prove that the matching preclusion number of $Q_{n,k}$ is $n+1$ \u00a0$(1\\leq k\\leq n-1)$, the strong matching preclusion number of $Q_{n,k}$ is $n+1$ \u00a0$(2\\leq k\\leq n-1)$, the conditional matching preclusion number of $Q_{n,n-1}$ is $2n-1$, the conditional matching preclusion number of $Q_{n,k}$ is $2n$ \u00a0$(1\\leq k\\leq n-2)$ and the conditional strong matching preclusion number of $Q_{n,n-2}$ is $2n-3$ \u00a0$(n\\geq 4)$.<\/jats:p>","DOI":"10.1093\/comjnl\/bxab029","type":"journal-article","created":{"date-parts":[[2021,3,17]],"date-time":"2021-03-17T20:10:08Z","timestamp":1616011808000},"page":"1874-1890","source":"Crossref","is-referenced-by-count":3,"title":["The Matching Preclusion of Enhanced Hypercubes"],"prefix":"10.1093","volume":"65","author":[{"given":"Shiying","family":"Wang","sequence":"first","affiliation":[{"name":"School of Mathematics and Computer Science , Shanxi Normal University, Linfen, Shanxi 041004, PR China"}]},{"given":"Xiaolei","family":"Ma","sequence":"additional","affiliation":[{"name":"College of Mathematics and Information Science , Henan Normal University, Xinxiang, Henan 453007, PR China"}]}],"member":"286","published-online":{"date-parts":[[2021,5,11]]},"reference":[{"key":"2022071813385992100_ref1","first-page":"185","article-title":"Perfect-matching preclusion","volume":"174","author":"Brigham","year":"2005","journal-title":"Congressus Numerantium"},{"key":"2022071813385992100_ref2","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1016\/j.ins.2008.10.029","article-title":"Conditional matching preclusion sets","volume":"179","author":"Cheng","year":"2009","journal-title":"Information Sciences"},{"key":"2022071813385992100_ref3","doi-asserted-by":"crossref","first-page":"1940011","DOI":"10.1142\/S0219265919400115","article-title":"Conditional matching preclusion for folded hypercubes","volume":"19","author":"Lin","year":"2019","journal-title":"Journal of Interconnection Networks"},{"key":"2022071813385992100_ref4","doi-asserted-by":"crossref","first-page":"2066","DOI":"10.1016\/j.dam.2010.08.017","article-title":"Matching preclusion for k-ary n-cubes","volume":"158","author":"Wang","year":"2010","journal-title":"Discrete Applied Mathematics"},{"key":"2022071813385992100_ref5","doi-asserted-by":"crossref","first-page":"6409","DOI":"10.1016\/j.tcs.2011.08.008","article-title":"Strong matching preclusion","volume":"412","author":"Parka","year":"2011","journal-title":"Theoretical Computer Science"},{"key":"2022071813385992100_ref6","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1016\/j.dam.2012.10.002","article-title":"Strong matching preclusion under the conditional fault model","volume":"161","author":"Parka","year":"2013","journal-title":"Discrete Applied Mathematics"},{"key":"2022071813385992100_ref7","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1080\/00207160.2014.913034","article-title":"Strong matching preclusion for two-dimensional torus networks","volume":"92","author":"Feng","year":"2015","journal-title":"International Journal of Computer Mathematics"},{"key":"2022071813385992100_ref8","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.tcs.2013.10.023","article-title":"Strong matching preclusion for torus networks","volume":"520","author":"Wang","year":"2014","journal-title":"Theoretical Computer Science"},{"key":"2022071813385992100_ref9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"Bondy","year":"2008"},{"key":"2022071813385992100_ref10","doi-asserted-by":"crossref","first-page":"728","DOI":"10.12677\/AAM.2016.54084","article-title":"The 1-good-neighbor connectivity and diagnosability of m\u00f6bius cubes","volume":"5","author":"Bai","year":"2016","journal-title":"Advances in Applied Mathematics"},{"key":"2022071813385992100_ref11","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1002\/net.20002","article-title":"Complete binary trees in folded and enhanced cubes","volume":"43","author":"Choudum","year":"2004","journal-title":"Networks"},{"key":"2022071813385992100_ref12","first-page":"258","article-title":"The routing algorithm for generalized hypercube","volume":"36","author":"Liu","year":"2006","journal-title":"Mathematics in Practice and Theory"},{"key":"2022071813385992100_ref13","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/12.76405","article-title":"Enhanced hypercube","volume":"40","author":"Tzeng","year":"1991","journal-title":"IEEE Transactions on Computers"},{"key":"2022071813385992100_ref14","doi-asserted-by":"crossref","first-page":"102113","DOI":"10.1109\/ACCESS.2019.2931574","article-title":"The h-extra connectivity and diagnosability of locally twisted cubes","volume":"7","author":"Wang","year":"2019","journal-title":"IEEE Access"},{"key":"2022071813385992100_ref15","first-page":"1287","article-title":"Super connectivity and diagnosability of crossed cubes","volume":"20","author":"Wang","year":"2019","journal-title":"Journal of Internet Technology"},{"key":"2022071813385992100_ref16","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.aml.2005.04.002","article-title":"Cycles in folded hypercubes","volume":"19","author":"Xu","year":"2006","journal-title":"Applied Mathematics Letters"},{"key":"2022071813385992100_ref17","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1142\/S0219265907001941","article-title":"Hamiltonian laceability of faulty hypercubes","volume":"8","author":"Sun","year":"2007","journal-title":"Journal of Interconnection Networks"},{"key":"2022071813385992100_ref18","first-page":"236","article-title":"The performance guaranteed new algorithm for fault-tolerant routing in folded cubes, Frontiers in Algorithmcs","author":"Liu","year":"2007","journal-title":"Lecture Notes on Computer Science"},{"key":"2022071813385992100_ref19","first-page":"251","article-title":"Properties of enhanced hypercube networks","volume":"6","author":"Liu","year":"2008","journal-title":"Journal of Systems Science and Information"},{"key":"2022071813385992100_ref20","first-page":"580","article-title":"Properties and performance of enhanced hypercube networks. The 4th International Conference on Networked Computing and Advanced","author":"Liu","year":"2008","journal-title":"Information Management"},{"key":"2022071813385992100_ref21","first-page":"345","article-title":"The structural features of enhanced hypercube networks","author":"Liu","year":"2009","journal-title":"The 5th International Conference on Natural Computation"},{"key":"2022071813385992100_ref22","doi-asserted-by":"crossref","first-page":"2632","DOI":"10.1016\/j.tcs.2009.02.041","article-title":"Conditional matching preclusion for hypercube-like interconnection networks","volume":"410","author":"Park","year":"2009","journal-title":"Theoretical Computer Science"},{"key":"2022071813385992100_ref23","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0020-0190(02)00214-4","article-title":"Fault-tolerant hamiltonian laceability of hypercubes","volume":"83","author":"Tsai","year":"2002","journal-title":"Information Processing Letters"},{"key":"2022071813385992100_ref24","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.tcs.2013.05.002","article-title":"Strong matching preclusion for augmented cubes","volume":"491","author":"Cheng","year":"2013","journal-title":"Theoretical Computer Science"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/65\/7\/1874\/44921871\/bxab029.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/65\/7\/1874\/44921871\/bxab029.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T13:43:34Z","timestamp":1658151814000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/65\/7\/1874\/6259656"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,11]]},"references-count":24,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2021,5,11]]},"published-print":{"date-parts":[[2022,7,15]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxab029","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2022,7,15]]},"published":{"date-parts":[[2021,5,11]]}}}