{"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}
引用次数: 1
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
