两个超立方体变体的分数阶强匹配排除

Q4 Mathematics

Theory and Applications of Graphs Pub Date : 2019-09-16 DOI:10.20429/tag.2019.060202

Huifen Ge, Tianlong Ma, Miaolin Wu, Yuzhi Xiao

{"title":"两个超立方体变体的分数阶强匹配排除","authors":"Huifen Ge, Tianlong Ma, Miaolin Wu, Yuzhi Xiao","doi":"10.20429/tag.2019.060202","DOIUrl":null,"url":null,"abstract":"Let F be a subset of edges and vertices of a graph G. If G − F has no fractional perfect matching, then F is a fractional strong matching preclusion set of G. The fractional strong matching preclusion number is the cardinality of a minimum fractional strong matching preclusion set. In this paper, we mainly study the fractional strong matching preclusion problem for two variants of hypercubes, the multiply twisted cube and the locally twisted cube, which are two of the most popular interconnection networks. In addition, we classify all the optimal fractional strong matching preclusion set of each.","PeriodicalId":37096,"journal":{"name":"Theory and Applications of Graphs","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Fractional strong matching preclusion for two variants of hypercubes\",\"authors\":\"Huifen Ge, Tianlong Ma, Miaolin Wu, Yuzhi Xiao\",\"doi\":\"10.20429/tag.2019.060202\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let F be a subset of edges and vertices of a graph G. If G − F has no fractional perfect matching, then F is a fractional strong matching preclusion set of G. The fractional strong matching preclusion number is the cardinality of a minimum fractional strong matching preclusion set. In this paper, we mainly study the fractional strong matching preclusion problem for two variants of hypercubes, the multiply twisted cube and the locally twisted cube, which are two of the most popular interconnection networks. In addition, we classify all the optimal fractional strong matching preclusion set of each.\",\"PeriodicalId\":37096,\"journal\":{\"name\":\"Theory and Applications of Graphs\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-16\",\"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.2019.060202\",\"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.060202","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 1

摘要

设F是图G的边和顶点的子集。若G−F不存在分数阶完美匹配，则F是G的分数阶强匹配排除集。其中分数阶强匹配排除集的最小分数阶强匹配排除集的基数为分数阶强匹配排除集。本文主要研究了超立方体的两种变体，即多重扭曲立方体和局部扭曲立方体的分数阶强匹配排除问题，这是两种最流行的互连网络。此外，我们还对每一种算法的所有最优分数型强匹配排除集进行了分类。

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

查看原文本刊更多论文

Fractional strong matching preclusion for two variants of hypercubes

Let F be a subset of edges and vertices of a graph G. If G − F has no fractional perfect matching, then F is a fractional strong matching preclusion set of G. The fractional strong matching preclusion number is the cardinality of a minimum fractional strong matching preclusion set. In this paper, we mainly study the fractional strong matching preclusion problem for two variants of hypercubes, the multiply twisted cube and the locally twisted cube, which are two of the most popular interconnection networks. In addition, we classify all the optimal fractional strong matching preclusion set of each.

求助全文

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

来源期刊

Theory and Applications of Graphs Mathematics-Discrete Mathematics and Combinatorics

CiteScore

0.70

自引率

0.00%

发文量

审稿时长

20 weeks