两种韧性的界限和星形因子的结合数

IF 0.5 Q4 COMPUTER SCIENCE, THEORY & METHODS JOURNAL OF INTERCONNECTION NETWORKS Pub Date : 2024-01-10 DOI:10.1142/s0219265923500329

Yujia Gao, Zhen Ji, Xiaojie Sun, Qinghe Tong

{"title":"两种韧性的界限和星形因子的结合数","authors":"Yujia Gao, Zhen Ji, Xiaojie Sun, Qinghe Tong","doi":"10.1142/s0219265923500329","DOIUrl":null,"url":null,"abstract":"For a set [Formula: see text] of connected graphs, a spanning subgraph [Formula: see text] of a graph [Formula: see text] is an [Formula: see text]-factor if every component of [Formula: see text] is isomorphic to some member of [Formula: see text]. In this paper, we give a criterion for the existence of tight toughness, isolated toughness and binding number bounds in a graph of a strong [Formula: see text]-star factor, [Formula: see text]-factor and [Formula: see text]-star factor. Moreover, we show that the bounds of the sufficient conditions are sharp.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":"64 3","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2024-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Bounds of Two Toughnesses and Binding Numbers for Star Factors\",\"authors\":\"Yujia Gao, Zhen Ji, Xiaojie Sun, Qinghe Tong\",\"doi\":\"10.1142/s0219265923500329\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For a set [Formula: see text] of connected graphs, a spanning subgraph [Formula: see text] of a graph [Formula: see text] is an [Formula: see text]-factor if every component of [Formula: see text] is isomorphic to some member of [Formula: see text]. In this paper, we give a criterion for the existence of tight toughness, isolated toughness and binding number bounds in a graph of a strong [Formula: see text]-star factor, [Formula: see text]-factor and [Formula: see text]-star factor. Moreover, we show that the bounds of the sufficient conditions are sharp.\",\"PeriodicalId\":53990,\"journal\":{\"name\":\"JOURNAL OF INTERCONNECTION NETWORKS\",\"volume\":\"64 3\",\"pages\":\"\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2024-01-10\",\"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/s0219265923500329\",\"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/s0219265923500329","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

摘要

对于一个连通图集[式：见文]，如果[式：见文]的每个分量都与[式：见文]的某个成员同构，则[式：见文]的跨子图[式：见文]是[式：见文]-因子。本文给出了强[式：见文本]-星因子、[式：见文本]-因子和[式：见文本]-星因子图中存在紧韧度、孤立韧度和结合数边界的判据。此外，我们还证明了充分条件的边界是尖锐的。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Bounds of Two Toughnesses and Binding Numbers for Star Factors

For a set [Formula: see text] of connected graphs, a spanning subgraph [Formula: see text] of a graph [Formula: see text] is an [Formula: see text]-factor if every component of [Formula: see text] is isomorphic to some member of [Formula: see text]. In this paper, we give a criterion for the existence of tight toughness, isolated toughness and binding number bounds in a graph of a strong [Formula: see text]-star factor, [Formula: see text]-factor and [Formula: see text]-star factor. Moreover, we show that the bounds of the sufficient conditions are sharp.

求助全文

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

来源期刊

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.

期刊最新文献

On the Local Metric Dimension of Graphs Bounds of Two Toughnesses and Binding Numbers for Star Factors Some Existence Theorems on Star Factors Krill Herd and Feed Forward Optimization System-Based Routing Protocol for IoT-MANET Environment Embedding Knödel Graph into Cube-like Architectures: Dilation Optimization and Wirelength Analysis