增强超立方体的条件匹配排除

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics Pub Date : 2025-09-09 DOI:10.1016/j.dam.2025.08.057

Luyao Zhang, Xiaomin Hu, Shuang Zhao, Weihua Yang

{"title":"增强超立方体的条件匹配排除","authors":"Luyao Zhang, Xiaomin Hu, Shuang Zhao, Weihua Yang","doi":"10.1016/j.dam.2025.08.057","DOIUrl":null,"url":null,"abstract":"<div><div>The conditional matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph with no isolated vertices that has neither perfect matchings nor almost perfect matchings. In this paper, we prove that the <span><math><mi>n</mi></math></span>-dimensional enhanced hypercubes are super conditional matched with <span><math><mrow><mi>n</mi><mo>≥</mo><mn>6</mn></mrow></math></span>. Our work is complementary to Lin et al. and Wang et al., who proved a special case of enhanced hypercubes is super conditional matched and calculated the conditional matching preclusion number of enhanced hypercubes, respectively.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"378 ","pages":"Pages 614-620"},"PeriodicalIF":1.0000,"publicationDate":"2025-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Conditional matching preclusion of enhanced hypercubes\",\"authors\":\"Luyao Zhang, Xiaomin Hu, Shuang Zhao, Weihua Yang\",\"doi\":\"10.1016/j.dam.2025.08.057\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The conditional matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph with no isolated vertices that has neither perfect matchings nor almost perfect matchings. In this paper, we prove that the <span><math><mi>n</mi></math></span>-dimensional enhanced hypercubes are super conditional matched with <span><math><mrow><mi>n</mi><mo>≥</mo><mn>6</mn></mrow></math></span>. Our work is complementary to Lin et al. and Wang et al., who proved a special case of enhanced hypercubes is super conditional matched and calculated the conditional matching preclusion number of enhanced hypercubes, respectively.</div></div>\",\"PeriodicalId\":50573,\"journal\":{\"name\":\"Discrete Applied Mathematics\",\"volume\":\"378 \",\"pages\":\"Pages 614-620\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2025-09-09\",\"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/S0166218X25005049\",\"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/S0166218X25005049","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 0

摘要

图的条件匹配排除数是图的最小边数，删除这些边会导致图没有孤立顶点，既不存在完美匹配，也不存在几乎完美匹配。本文证明了n维增强超立方体是n≥6的超条件匹配。我们的工作与Lin等人和Wang等人的工作是互补的，他们分别证明了增强超立方体的一种特殊情况是超条件匹配的，并计算了增强超立方体的条件匹配排除数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Conditional matching preclusion of enhanced hypercubes

The conditional matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph with no isolated vertices that has neither perfect matchings nor almost perfect matchings. In this paper, we prove that the

n

-dimensional enhanced hypercubes are super conditional matched with

n \geq 6

. Our work is complementary to Lin et al. and Wang et al., who proved a special case of enhanced hypercubes is super conditional matched and calculated the conditional matching preclusion number of enhanced hypercubes, respectively.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Discrete Applied Mathematics 数学-应用数学

CiteScore

2.30

自引率

9.10%

发文量

422

审稿时长

4.5 months

期刊介绍： 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.