关于星形因子的一些存在定理

IF 0.5 Q4 COMPUTER SCIENCE, THEORY & METHODS

JOURNAL OF INTERCONNECTION NETWORKS Pub Date : 2023-11-29 DOI:10.1142/s0219265923500275

Xiumin Wang, Fengyun Ren, Dong He, Ao Tan

{"title":"关于星形因子的一些存在定理","authors":"Xiumin Wang, Fengyun Ren, Dong He, Ao Tan","doi":"10.1142/s0219265923500275","DOIUrl":null,"url":null,"abstract":"The [Formula: see text]-factor and [Formula: see text]-factor of a graph are a spanning subgraph whose each component is an element of [Formula: see text] and [Formula: see text], respectively, where [Formula: see text] is a special family of trees. In this paper, we obtain a sufficient condition in terms of tight toughness, isolated toughness and binding number bounds to guarantee the existence of a [Formula: see text]-factor and [Formula: see text]-factor for any graph.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":"55 1","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2023-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Some Existence Theorems on Star Factors\",\"authors\":\"Xiumin Wang, Fengyun Ren, Dong He, Ao Tan\",\"doi\":\"10.1142/s0219265923500275\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The [Formula: see text]-factor and [Formula: see text]-factor of a graph are a spanning subgraph whose each component is an element of [Formula: see text] and [Formula: see text], respectively, where [Formula: see text] is a special family of trees. In this paper, we obtain a sufficient condition in terms of tight toughness, isolated toughness and binding number bounds to guarantee the existence of a [Formula: see text]-factor and [Formula: see text]-factor for any graph.\",\"PeriodicalId\":53990,\"journal\":{\"name\":\"JOURNAL OF INTERCONNECTION NETWORKS\",\"volume\":\"55 1\",\"pages\":\"\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2023-11-29\",\"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/s0219265923500275\",\"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/s0219265923500275","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

摘要

图的[式：见文]因子和[式：见文]因子是一个跨子图，其每个分量分别是[式：见文]和[式：见文]的元素，其中[式：见文]是一个特殊的树族。本文从紧密韧度、孤立韧度和绑定数边界等方面得到了一个充分条件，以保证任何图都存在[式：见正文]因子和[式：见正文]因子。

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

查看原文本刊更多论文

Some Existence Theorems on Star Factors

The [Formula: see text]-factor and [Formula: see text]-factor of a graph are a spanning subgraph whose each component is an element of [Formula: see text] and [Formula: see text], respectively, where [Formula: see text] is a special family of trees. In this paper, we obtain a sufficient condition in terms of tight toughness, isolated toughness and binding number bounds to guarantee the existence of a [Formula: see text]-factor and [Formula: see text]-factor for any graph.

求助全文

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

来源期刊

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.