星径因子的紧密韧性、孤立韧性和结合数界限

IF 0.5 Q4 COMPUTER SCIENCE, THEORY & METHODS

JOURNAL OF INTERCONNECTION NETWORKS Pub Date : 2023-10-20 DOI:10.1142/s0219265923500202

Yifan Yao, Jinxia Liang, Yue Li, Rongrong Ma

{"title":"星径因子的紧密韧性、孤立韧性和结合数界限","authors":"Yifan Yao, Jinxia Liang, Yue Li, Rongrong Ma","doi":"10.1142/s0219265923500202","DOIUrl":null,"url":null,"abstract":"For a set [Formula: see text] of connected graphs, a spanning subgraph [Formula: see text] of [Formula: see text] is called a [Formula: see text] if each component of [Formula: see text] is isomorphic to a member of [Formula: see text]. In this paper, some sufficient conditions with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the [Formula: see text]-factor and [Formula: see text]-factor for any graph are obtained.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2023-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Tight Toughness, Isolated Toughness and Binding Number Bounds for the Star-Path Factor\",\"authors\":\"Yifan Yao, Jinxia Liang, Yue Li, Rongrong Ma\",\"doi\":\"10.1142/s0219265923500202\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For a set [Formula: see text] of connected graphs, a spanning subgraph [Formula: see text] of [Formula: see text] is called a [Formula: see text] if each component of [Formula: see text] is isomorphic to a member of [Formula: see text]. In this paper, some sufficient conditions with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the [Formula: see text]-factor and [Formula: see text]-factor for any graph are obtained.\",\"PeriodicalId\":53990,\"journal\":{\"name\":\"JOURNAL OF INTERCONNECTION NETWORKS\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2023-10-20\",\"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/s0219265923500202\",\"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/s0219265923500202","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

对于连通图的集合[公式:见文]，如果[公式:见文]的每个组成部分与[公式:见文]的一个成员同构，则[公式:见文]的生成子图[公式:见文]称为[公式:见文]。本文给出了任意图的紧韧性、孤立韧性和约束数界存在的充分条件，以保证任意图的[公式:见文]因子和[公式:见文]因子的存在。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Tight Toughness, Isolated Toughness and Binding Number Bounds for the Star-Path Factor

For a set [Formula: see text] of connected graphs, a spanning subgraph [Formula: see text] of [Formula: see text] is called a [Formula: see text] if each component of [Formula: see text] is isomorphic to a member of [Formula: see text]. In this paper, some sufficient conditions with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the [Formula: see text]-factor and [Formula: see text]-factor for any graph are obtained.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

JOURNAL OF INTERCONNECTION NETWORKS COMPUTER SCIENCE, THEORY & METHODS-

自引率

14.30%

发文量

121

期刊介绍： 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.