{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:40Z","timestamp":1759063480701,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,4,28]],"date-time":"2023-04-28T00:00:00Z","timestamp":1682640000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,28]],"date-time":"2023-04-28T00:00:00Z","timestamp":1682640000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11801061","12271229","12271228"],"award-info":[{"award-number":["11801061","12271229","12271228"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017577","name":"Basic Public Welfare Research Program of Zhejiang Province","doi-asserted-by":"publisher","award":["2021-ZJ-703"],"award-info":[{"award-number":["2021-ZJ-703"]}],"id":[{"id":"10.13039\/501100017577","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10878-023-01034-5","type":"journal-article","created":{"date-parts":[[2023,4,28]],"date-time":"2023-04-28T13:03:06Z","timestamp":1682686986000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On anti-Kekul\u00e9 and s-restricted matching preclusion problems"],"prefix":"10.1007","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1033-2386","authenticated-orcid":false,"given":"Huazhong","family":"L\u00fc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianyue","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heping","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,28]]},"reference":[{"key":"1034_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jpdc.2001.1770","volume":"62","author":"A Al-Ayyoub","year":"2002","unstructured":"Al-Ayyoub A, Day K (2002) Comparative study of product networks. J Parallel Distrib Comput 62:1\u201318","journal-title":"J Parallel Distrib Comput"},{"key":"1034_CR2","volume-title":"Graph theory","author":"JA Bondy","year":"2007","unstructured":"Bondy JA, Murty USR (2007) Graph theory. Springer, New York"},{"key":"1034_CR3","first-page":"185","volume":"174","author":"RC Brigham","year":"2005","unstructured":"Brigham RC, Harary F, Biolin EC, Yellen J (2005) Perfect-matching preclusion. Congr Numer 174:185\u2013192","journal-title":"Congr Numer"},{"issue":"3","key":"1034_CR4","first-page":"733","volume":"69","author":"J Cai","year":"2013","unstructured":"Cai J, Zhang H (2013) On the anti-Kekul\u00e9 number of a hexagonal system. MATCH Commun Math Comput Chem 69(3):733\u2013754","journal-title":"MATCH Commun Math Comput Chem"},{"issue":"2","key":"1034_CR5","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/net.20187","volume":"50","author":"E Cheng","year":"2007","unstructured":"Cheng E, Lipt\u00e1k L (2007) Matching preclusion for some interconnection networks. Networks 50(2):173\u2013180","journal-title":"Networks"},{"key":"1034_CR6","doi-asserted-by":"publisher","first-page":"1699","DOI":"10.1016\/j.dam.2012.03.014","volume":"12","author":"E Cheng","year":"2012","unstructured":"Cheng E, Lipt\u00e1k L (2012) Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products. Discrete Appl Math 12:1699\u20131716","journal-title":"Discrete Appl Math"},{"key":"1034_CR7","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1016\/j.ins.2008.10.029","volume":"179","author":"E Cheng","year":"2009","unstructured":"Cheng E, Lesniak L, Lipman MJ, Lipt\u00e1k L (2009) Conditional matching preclusion sets. Inf Sci 179:1092\u20131101","journal-title":"Inf Sci"},{"key":"1034_CR8","doi-asserted-by":"crossref","unstructured":"Cheng E, Lipman MJ, Lipt\u00e1k L (2012a) Matching preclusion and conditional matching preclusion for regular interconnection networks. Discrete Appl Math 160:1936\u20131954","DOI":"10.1016\/j.dam.2012.03.040"},{"key":"1034_CR9","doi-asserted-by":"crossref","unstructured":"Cheng E, Hu P, Jia R, Lipt\u00e1k L (2012b) Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: sufficient conditions. Networks 59:349\u2013356","DOI":"10.1002\/net.20440"},{"key":"1034_CR10","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.tcs.2015.01.046","volume":"576","author":"E Cheng","year":"2015","unstructured":"Cheng E, Connolly R, Melekian C (2015) Matching preclusion and conditional matching preclusion problems for the folded Petersen cube. Theor Comput Sci 576:30\u201344","journal-title":"Theor Comput Sci"},{"key":"1034_CR11","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1155\/1995\/95759","volume":"2","author":"S Das","year":"1995","unstructured":"Das S, \u00d6hring S, Banerjee A (1995) Embeddings into hyper Petersen network: yet another hypercube-like interconnection topology. VLSI Des 2:335\u2013351","journal-title":"VLSI Des"},{"key":"1034_CR12","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.dam.2018.02.012","volume":"243","author":"Q Ding","year":"2018","unstructured":"Ding Q, Zhang H, Zhou H (2018) Matching preclusion for $$n$$-grid graphs. Discrete Appl Math 243:194\u2013206","journal-title":"Discrete Appl Math"},{"key":"1034_CR13","doi-asserted-by":"publisher","first-page":"1586","DOI":"10.1109\/12.42131","volume":"38","author":"AH Esfahanian","year":"1989","unstructured":"Esfahanian AH (1989) Generalized measures of fault tolerance with application to $$n$$-cube networks. IEEE Trans Comput 38:1586\u20131591","journal-title":"IEEE Trans Comput"},{"key":"1034_CR14","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0012-365X(94)00369-T","volume":"155","author":"J F\u00e0brega","year":"1996","unstructured":"F\u00e0brega J, Fiol MA (1996) On the extraconnectivity of graphs. Discrete Math 155:49\u201357","journal-title":"Discrete Math"},{"key":"1034_CR15","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1002\/net.3230130303","volume":"13","author":"F Harary","year":"1983","unstructured":"Harary F (1983) Conditional connectivity. Networks 13:347\u2013357","journal-title":"Networks"},{"key":"1034_CR16","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2011.12.065","volume":"423","author":"M Lacroix","year":"2012","unstructured":"Lacroix M, Mahjoub AR, Martin S, Picouleau C (2012) On the NP-completeness of the perfect matching free subgraph problem. Theor Comput Sci 423:25\u201329","journal-title":"Theor Comput Sci"},{"key":"1034_CR17","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.dam.2015.04.001","volume":"190\u2013191","author":"Q Li","year":"2015","unstructured":"Li Q, Shiu W, Yao H (2015) Matching preclusion for cube-connected cycles. Discrete Appl Math 190\u2013191:118\u2013126","journal-title":"Discrete Appl Math"},{"key":"1034_CR18","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.dam.2017.07.039","volume":"233","author":"R Lin","year":"2017","unstructured":"Lin R, Zhang H (2017) Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs. Discrete Appl Math 233:104\u2013117","journal-title":"Discrete Appl Math"},{"key":"1034_CR20","unstructured":"L\u00fc H, Wu T (2019) Super edge-connectivity and matching preclusion of data center networks. Discrete Math Theor Comput Sci 21(4)"},{"key":"1034_CR19","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.tcs.2012.09.020","volume":"465","author":"H L\u00fc","year":"2012","unstructured":"L\u00fc H, Li X, Zhang H (2012) Matching preclusion for balanced hypercubes. Theor Comput Sci 465:10\u201320","journal-title":"Theor Comput Sci"},{"key":"1034_CR21","doi-asserted-by":"publisher","first-page":"2632","DOI":"10.1016\/j.tcs.2009.02.041","volume":"410","author":"J Park","year":"2009","unstructured":"Park J, Son S (2009) Conditional matching preclusion for hypercube-like interconnection networks. Theor Comput Sci 410:2632\u20132640","journal-title":"Theor Comput Sci"},{"key":"1034_CR22","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s10910-006-9133-6","volume":"42","author":"D Vuki\u010devi\u0107","year":"2007","unstructured":"Vuki\u010devi\u0107 D, Trinajsti\u0107 N (2007) On the anti-forcing number of benzenoids. J Math Chem 42:575\u2013583","journal-title":"J Math Chem"},{"key":"1034_CR23","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/s10910-006-9223-5","volume":"43","author":"D Vuki\u010devi\u0107","year":"2008","unstructured":"Vuki\u010devi\u0107 D, Trinajsti\u0107 N (2008) On the anti-Kekul\u00e9 number and anti-forcing number of cata-condensed benzenoids. J Math Chem 43:719\u2013726","journal-title":"J Math Chem"},{"key":"1034_CR24","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1016\/j.disc.2008.01.037","volume":"309","author":"S Wang","year":"2009","unstructured":"Wang S, Lin S, Li C (2009) Sufficient conditions for super $$k$$-restricted edge connectivity in graphs of diameter 2. Discrete Math 309:908\u2013919","journal-title":"Discrete Math"},{"key":"1034_CR25","doi-asserted-by":"publisher","first-page":"2066","DOI":"10.1016\/j.dam.2010.08.017","volume":"158","author":"S Wang","year":"2010","unstructured":"Wang S, Wang R, Lin S, Li J (2010) Matching preclusion for $$k$$-ary $$n$$-cubes. Discrete Appl Math 158:2066\u20132070","journal-title":"Discrete Appl Math"},{"key":"1034_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.55016\/ojs\/cdm.v16i3.62279","volume":"16","author":"B Wu","year":"2021","unstructured":"Wu B, Zhang H (2021) Graphs where each spanning tree has a perfect matching. Contrib Discrete Math 16:1\u20138","journal-title":"Contrib Discrete Math"},{"issue":"2","key":"1034_CR27","first-page":"281","volume":"67","author":"Q Yang","year":"2012","unstructured":"Yang Q, Ye D, Zhang H, Lin Y (2012) The anti-Kekul\u00e9 number of fullerene graphs. MATCH Commun Math Comput Chem 67(2):281\u2013288","journal-title":"MATCH Commun Math Comput Chem"},{"key":"1034_CR28","doi-asserted-by":"publisher","first-page":"4306","DOI":"10.1016\/j.disc.2009.01.006","volume":"309","author":"R Zenklusen","year":"2009","unstructured":"Zenklusen R, Ries B, Picouleau C, Werra D, Costa M-C, Bentz C (2009) Blockers and transversals. Discrete Math 309:4306\u20134314","journal-title":"Discrete Math"},{"key":"1034_CR29","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/j.dam.2020.02.006","volume":"283","author":"L Zhao","year":"2020","unstructured":"Zhao L, Zhang H (2020) On the anti-Kekul\u00e9 number of (4,5,6)-fullerenes. Discrete Appl Math 283:577\u2013589","journal-title":"Discrete Appl Math"},{"key":"1034_CR30","first-page":"246","volume":"36","author":"Q Zhu","year":"2006","unstructured":"Zhu Q, Xu J-M (2006) On restricted edge connectivity and extra edge connectivity of hypercubes and foled hypercubes. J Univ Sci Technol China 36:246\u2013253","journal-title":"J Univ Sci Technol China"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01034-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01034-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01034-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T11:50:20Z","timestamp":1729338620000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01034-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,28]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1034"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01034-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2023,4,28]]},"assertion":[{"value":"13 April 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors have not disclosed any competing interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interest"}}],"article-number":"103"}}