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

Q4 Mathematics

Theory and Applications of Graphs Pub Date : 2021-01-01 DOI:10.20429/TAG.2021.080105

Mohamad Abdallah, E. Cheng

{"title":"增广立方体的条件强匹配排除","authors":"Mohamad Abdallah, E. Cheng","doi":"10.20429/TAG.2021.080105","DOIUrl":null,"url":null,"abstract":"The strong matching preclusion is a measure for the robustness of interconnection networks in the presence of node and/or link failures. However, in the case of random link and/or node failures, it is unlikely to find all the faults incident and/or adjacent to the same vertex. This motivates Park et al. to introduce the conditional strong matching preclusion of a graph. In this paper we consider the conditional strong matching preclusion problem of the augmented cube AQn, which is a variation of the hypercube Qn that possesses favorable properties.","PeriodicalId":37096,"journal":{"name":"Theory and Applications of Graphs","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The Conditional Strong Matching Preclusion of Augmented Cubes\",\"authors\":\"Mohamad Abdallah, E. Cheng\",\"doi\":\"10.20429/TAG.2021.080105\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The strong matching preclusion is a measure for the robustness of interconnection networks in the presence of node and/or link failures. However, in the case of random link and/or node failures, it is unlikely to find all the faults incident and/or adjacent to the same vertex. This motivates Park et al. to introduce the conditional strong matching preclusion of a graph. In this paper we consider the conditional strong matching preclusion problem of the augmented cube AQn, which is a variation of the hypercube Qn that possesses favorable properties.\",\"PeriodicalId\":37096,\"journal\":{\"name\":\"Theory and Applications of Graphs\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Theory and Applications of Graphs\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.20429/TAG.2021.080105\",\"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.2021.080105","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 1

摘要

强匹配排除是在存在节点和/或链路故障的情况下互连网络鲁棒性的度量。然而，在随机链路和/或节点故障的情况下，不太可能找到所有故障事件和/或邻近同一顶点。这促使Park等人引入图的条件强匹配排除。本文考虑增广立方Qn的条件强匹配排除问题，增广立方Qn是超立方Qn的一种变体，具有良好的性质。

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

查看原文本刊更多论文

The Conditional Strong Matching Preclusion of Augmented Cubes

The strong matching preclusion is a measure for the robustness of interconnection networks in the presence of node and/or link failures. However, in the case of random link and/or node failures, it is unlikely to find all the faults incident and/or adjacent to the same vertex. This motivates Park et al. to introduce the conditional strong matching preclusion of a graph. In this paper we consider the conditional strong matching preclusion problem of the augmented cube AQn, which is a variation of the hypercube Qn that possesses favorable properties.

求助全文

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

来源期刊

Theory and Applications of Graphs Mathematics-Discrete Mathematics and Combinatorics

CiteScore

0.70

自引率

0.00%

发文量

审稿时长

20 weeks