{"title":"构件因素存在的(隔离)韧性和结合数的充分条件","authors":"Zhiqiang Ma, Fengyun Ren, Meiqin Wei, Gemaji Bao","doi":"10.1142/s0219265923500135","DOIUrl":null,"url":null,"abstract":"For a family of connected graphs [Formula: see text], a spanning subgraph [Formula: see text] of [Formula: see text] is called an [Formula: see text]-factor if each component of [Formula: see text] is isomorphic to a member of [Formula: see text]. In this paper, sufficient conditions with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the [Formula: see text]-factor, [Formula: see text]-factor or [Formula: see text]-factor for [Formula: see text] are obtained.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":"1 1","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2023-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Sufficient Conditions of (Isolated) Toughness and Binding Number for the Existence of Component Factors\",\"authors\":\"Zhiqiang Ma, Fengyun Ren, Meiqin Wei, Gemaji Bao\",\"doi\":\"10.1142/s0219265923500135\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For a family of connected graphs [Formula: see text], a spanning subgraph [Formula: see text] of [Formula: see text] is called an [Formula: see text]-factor if each component of [Formula: see text] is isomorphic to a member of [Formula: see text]. In this paper, sufficient conditions with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the [Formula: see text]-factor, [Formula: see text]-factor or [Formula: see text]-factor for [Formula: see text] are obtained.\",\"PeriodicalId\":53990,\"journal\":{\"name\":\"JOURNAL OF INTERCONNECTION NETWORKS\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2023-07-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"JOURNAL OF INTERCONNECTION NETWORKS\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s0219265923500135\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"JOURNAL OF INTERCONNECTION NETWORKS","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0219265923500135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
Sufficient Conditions of (Isolated) Toughness and Binding Number for the Existence of Component Factors
For a family of connected graphs [Formula: see text], a spanning subgraph [Formula: see text] of [Formula: see text] is called an [Formula: see text]-factor if each component of [Formula: see text] is isomorphic to a member of [Formula: see text]. In this paper, sufficient conditions with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the [Formula: see text]-factor, [Formula: see text]-factor or [Formula: see text]-factor for [Formula: see text] are obtained.
期刊介绍：
The Journal of Interconnection Networks (JOIN) is an international scientific journal dedicated to advancing the state-of-the-art of interconnection networks. The journal addresses all aspects of interconnection networks including their theory, analysis, design, implementation and application, and corresponding issues of communication, computing and function arising from (or applied to) a variety of multifaceted networks. Interconnection problems occur at different levels in the hardware and software design of communicating entities in integrated circuits, multiprocessors, multicomputers, and communication networks as diverse as telephone systems, cable network systems, computer networks, mobile communication networks, satellite network systems, the Internet and biological systems.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
