{"title":"路径周期因子的紧密韧性、孤立韧性和结合数界限","authors":"Weizhen Chen, Suonan Renqian, Qingcuo Ren, Xin Li","doi":"10.1080/23799927.2023.2278109","DOIUrl":null,"url":null,"abstract":"In this paper, a sufficient condition with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the $ \\{K_{2}, C_{n}:n\\geq 3\\} $ {K2,Cn:n≥3}-factor and $ \\{P_{2}, P_{3}\\} $ {P2,P3}-factor for any graph is obtained.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":"1 1","pages":"235 - 241"},"PeriodicalIF":0.9000,"publicationDate":"2023-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Tight toughness, isolated toughness and binding number bounds for the path-cycle factors\",\"authors\":\"Weizhen Chen, Suonan Renqian, Qingcuo Ren, Xin Li\",\"doi\":\"10.1080/23799927.2023.2278109\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a sufficient condition with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the $ \\\\{K_{2}, C_{n}:n\\\\geq 3\\\\} $ {K2,Cn:n≥3}-factor and $ \\\\{P_{2}, P_{3}\\\\} $ {P2,P3}-factor for any graph is obtained.\",\"PeriodicalId\":37216,\"journal\":{\"name\":\"International Journal of Computer Mathematics: Computer Systems Theory\",\"volume\":\"1 1\",\"pages\":\"235 - 241\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2023-10-02\",\"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.2023.2278109\",\"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.2023.2278109","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
Tight toughness, isolated toughness and binding number bounds for the path-cycle factors
In this paper, a sufficient condition with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the $ \{K_{2}, C_{n}:n\geq 3\} $ {K2,Cn:n≥3}-factor and $ \{P_{2}, P_{3}\} $ {P2,P3}-factor for any graph is obtained.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
