{"title":"折叠超立方体的强匹配排除","authors":"Zhicheng Lin, Ruizhi Lin","doi":"10.1016/j.dam.2025.08.045","DOIUrl":null,"url":null,"abstract":"<div><div>The strong matching preclusion number of <span><math><mi>G</mi></math></span> is the minimum number of vertices and edges whose deletion leaves the resulting graph without a perfect matching or an almost perfect matching. This concept was introduced by Park and Son to extending the classic matching preclusion problem. In this paper, we focus on strong matching preclusion for folded hypercube <span><math><mrow><mi>F</mi><msub><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math></span>, an important variant of hypercube. We show that strong matching preclusion number of <span><math><mrow><mi>F</mi><msub><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math></span> is <span><math><mrow><mi>n</mi><mo>+</mo><mn>1</mn></mrow></math></span> for even <span><math><mrow><mi>n</mi><mo>⩾</mo><mn>4</mn></mrow></math></span>.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"378 ","pages":"Pages 594-601"},"PeriodicalIF":1.0000,"publicationDate":"2025-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Strong matching preclusion for folded hypercubes\",\"authors\":\"Zhicheng Lin, Ruizhi Lin\",\"doi\":\"10.1016/j.dam.2025.08.045\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The strong matching preclusion number of <span><math><mi>G</mi></math></span> is the minimum number of vertices and edges whose deletion leaves the resulting graph without a perfect matching or an almost perfect matching. This concept was introduced by Park and Son to extending the classic matching preclusion problem. In this paper, we focus on strong matching preclusion for folded hypercube <span><math><mrow><mi>F</mi><msub><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math></span>, an important variant of hypercube. We show that strong matching preclusion number of <span><math><mrow><mi>F</mi><msub><mrow><mi>Q</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow></math></span> is <span><math><mrow><mi>n</mi><mo>+</mo><mn>1</mn></mrow></math></span> for even <span><math><mrow><mi>n</mi><mo>⩾</mo><mn>4</mn></mrow></math></span>.</div></div>\",\"PeriodicalId\":50573,\"journal\":{\"name\":\"Discrete Applied Mathematics\",\"volume\":\"378 \",\"pages\":\"Pages 594-601\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2025-09-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Applied Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0166218X25004834\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X25004834","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
The strong matching preclusion number of is the minimum number of vertices and edges whose deletion leaves the resulting graph without a perfect matching or an almost perfect matching. This concept was introduced by Park and Son to extending the classic matching preclusion problem. In this paper, we focus on strong matching preclusion for folded hypercube , an important variant of hypercube. We show that strong matching preclusion number of is for even .
期刊介绍:
The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal.
Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.