{"title":"Tight toughness, isolated toughness and binding number bounds for the path factors","authors":"Yue Li, Fengyun Ren, Xinxin Xu, Qin Tong","doi":"10.1080/23799927.2023.2190038","DOIUrl":null,"url":null,"abstract":"For a set of connected subgraphs, an -factor denotes a spanning subgraph D of G if each component of D is isomorphic to a member of . In this paper, some sufficient conditions with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the -factor and -factor for a graph are obtained.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":"94 1","pages":"143 - 151"},"PeriodicalIF":0.9000,"publicationDate":"2023-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","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.2190038","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 1
Abstract
For a set of connected subgraphs, an -factor denotes a spanning subgraph D of G if each component of D is isomorphic to a member of . In this paper, some sufficient conditions with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the -factor and -factor for a graph are obtained.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
