规则互连网络的高阶匹配排除

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics Pub Date : 2025-04-28 DOI:10.1016/j.dam.2025.04.042

Eddie Cheng, László Lipták, Lucian Mazza

{"title":"规则互连网络的高阶匹配排除","authors":"Eddie Cheng, László Lipták, Lucian Mazza","doi":"10.1016/j.dam.2025.04.042","DOIUrl":null,"url":null,"abstract":"<div><div>For a graph with an even number of vertices, the <em>matching preclusion number</em> is the minimum number of edges whose deletion results in a graph with no perfect matchings. The <em>conditional matching preclusion number</em>, introduced as an extension of the matching preclusion number, has the additional requirement that the resulting graph has no isolated vertices. In this paper we consider results related to a further generalization of this concept, called level 2 matching preclusion. We find sufficient conditions for a graph with girth at least 4 to be level 2 maximally matched and level 2 super matched. We apply these results to the class of pancake graphs, and show that they are level 2 maximally and super matched.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"373 ","pages":"Pages 107-124"},"PeriodicalIF":1.0000,"publicationDate":"2025-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Higher order matching preclusion for regular interconnection networks\",\"authors\":\"Eddie Cheng, László Lipták, Lucian Mazza\",\"doi\":\"10.1016/j.dam.2025.04.042\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>For a graph with an even number of vertices, the <em>matching preclusion number</em> is the minimum number of edges whose deletion results in a graph with no perfect matchings. The <em>conditional matching preclusion number</em>, introduced as an extension of the matching preclusion number, has the additional requirement that the resulting graph has no isolated vertices. In this paper we consider results related to a further generalization of this concept, called level 2 matching preclusion. We find sufficient conditions for a graph with girth at least 4 to be level 2 maximally matched and level 2 super matched. We apply these results to the class of pancake graphs, and show that they are level 2 maximally and super matched.</div></div>\",\"PeriodicalId\":50573,\"journal\":{\"name\":\"Discrete Applied Mathematics\",\"volume\":\"373 \",\"pages\":\"Pages 107-124\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2025-04-28\",\"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/S0166218X25002227\",\"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/S0166218X25002227","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 0

摘要

对于具有偶数个顶点的图，匹配排除数是其删除导致图无完美匹配的最小边数。作为匹配排除数的扩展引入的条件匹配排除数有一个额外的要求，即结果图没有孤立的顶点。在本文中，我们考虑与此概念的进一步推广有关的结果，称为二级匹配排除。我们找到了一个周长至少为4的图是第2级最大匹配和第2级超匹配的充分条件。我们将这些结果应用于一类煎饼图，并证明了它们是2级最大和超匹配的。

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

查看原文本刊更多论文

Higher order matching preclusion for regular interconnection networks

For a graph with an even number of vertices, the matching preclusion number is the minimum number of edges whose deletion results in a graph with no perfect matchings. The conditional matching preclusion number, introduced as an extension of the matching preclusion number, has the additional requirement that the resulting graph has no isolated vertices. In this paper we consider results related to a further generalization of this concept, called level 2 matching preclusion. We find sufficient conditions for a graph with girth at least 4 to be level 2 maximally matched and level 2 super matched. We apply these results to the class of pancake graphs, and show that they are level 2 maximally and super matched.

求助全文

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

来源期刊

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.