路径因子的紧密韧性、孤立韧性和绑定数界限

IF 0.9 Q3 COMPUTER SCIENCE, THEORY & METHODS

International Journal of Computer Mathematics: Computer Systems Theory Pub Date : 2023-03-13 DOI:10.1080/23799927.2023.2190038

Yue Li, Fengyun Ren, Xinxin Xu, Qin Tong

{"title":"路径因子的紧密韧性、孤立韧性和绑定数界限","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":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2023-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"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\":null,\"pages\":null},\"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}","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

摘要

对于一组连通子图，如果D的每个分量同构于的一个成员，则-因子表示G的生成子图D。本文给出了图的-因子和-因子存在的紧韧性、孤立韧性和约束数界的几个充分条件。

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

查看原文本刊更多论文

Tight toughness, isolated toughness and binding number bounds for the path factors

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.

求助全文

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

来源期刊

International Journal of Computer Mathematics: Computer Systems Theory Computer Science-Computational Theory and Mathematics

CiteScore

1.80

自引率

0.00%

发文量