{"title":"烧焦煎饼图和类煎饼图的条件分数匹配排除","authors":"Sambhav Gupta, Eddie Cheng, László Lipták","doi":"10.1080/23799927.2022.2110159","DOIUrl":null,"url":null,"abstract":"ABSTRACT The conditional fractional strong matching preclusion number of a graph G is the minimum size of F such that and G−F has neither a fractional perfect matching nor an isolated vertex. In this paper, we obtain the conditional fractional strong matching preclusion number for burnt pancake graphs and a subset of the class of pancake-like graphs.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":"163 1","pages":"207 - 222"},"PeriodicalIF":0.9000,"publicationDate":"2022-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs\",\"authors\":\"Sambhav Gupta, Eddie Cheng, László Lipták\",\"doi\":\"10.1080/23799927.2022.2110159\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ABSTRACT The conditional fractional strong matching preclusion number of a graph G is the minimum size of F such that and G−F has neither a fractional perfect matching nor an isolated vertex. In this paper, we obtain the conditional fractional strong matching preclusion number for burnt pancake graphs and a subset of the class of pancake-like graphs.\",\"PeriodicalId\":37216,\"journal\":{\"name\":\"International Journal of Computer Mathematics: Computer Systems Theory\",\"volume\":\"163 1\",\"pages\":\"207 - 222\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2022-08-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computer Mathematics: Computer Systems Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/23799927.2022.2110159\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Mathematics: Computer Systems Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/23799927.2022.2110159","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs
ABSTRACT The conditional fractional strong matching preclusion number of a graph G is the minimum size of F such that and G−F has neither a fractional perfect matching nor an isolated vertex. In this paper, we obtain the conditional fractional strong matching preclusion number for burnt pancake graphs and a subset of the class of pancake-like graphs.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
