交替群图的条件强匹配排除

Q4 Mathematics

Theory and Applications of Graphs Pub Date : 2019-01-01 DOI:10.20429/tag.2019.060205

Mohamad Abdallah, E. Cheng

{"title":"交替群图的条件强匹配排除","authors":"Mohamad Abdallah, E. Cheng","doi":"10.20429/tag.2019.060205","DOIUrl":null,"url":null,"abstract":"The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. Park and Ihm introduced the problem of strong matching preclusion under the condition that no isolated vertex is created as a result of faults. In this paper, we find the conditional strong matching preclusion number for the n-dimensional alternating group graph AGn.","PeriodicalId":37096,"journal":{"name":"Theory and Applications of Graphs","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Conditional Strong Matching Preclusion of the Alternating Group Graph\",\"authors\":\"Mohamad Abdallah, E. Cheng\",\"doi\":\"10.20429/tag.2019.060205\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. Park and Ihm introduced the problem of strong matching preclusion under the condition that no isolated vertex is created as a result of faults. In this paper, we find the conditional strong matching preclusion number for the n-dimensional alternating group graph AGn.\",\"PeriodicalId\":37096,\"journal\":{\"name\":\"Theory and Applications of Graphs\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Theory and Applications of Graphs\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.20429/tag.2019.060205\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theory and Applications of Graphs","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.20429/tag.2019.060205","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 2

摘要

图的强匹配排除数是图的顶点和边的最小数量，删除这些顶点和边会导致图既没有完美匹配，也没有几乎完美匹配。Park和Ihm提出了在故障不产生孤立顶点的情况下的强匹配排除问题。本文给出了n维交替群图AGn的条件强匹配排除数。

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

查看原文本刊更多论文

Conditional Strong Matching Preclusion of the Alternating Group Graph

The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. Park and Ihm introduced the problem of strong matching preclusion under the condition that no isolated vertex is created as a result of faults. In this paper, we find the conditional strong matching preclusion number for the n-dimensional alternating group graph AGn.

求助全文

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

来源期刊

Theory and Applications of Graphs Mathematics-Discrete Mathematics and Combinatorics

CiteScore

0.70

自引率

0.00%

发文量

审稿时长

20 weeks