[1,n]-因子和{K2,Ci≥4}-因子的紧密韧性、孤立韧性和结合数界限

IF 0.5 Q4 COMPUTER SCIENCE, THEORY & METHODS JOURNAL OF INTERCONNECTION NETWORKS Pub Date : 2023-06-21 DOI:10.1142/s021926592350010x

Xiao Xu, Zhuoma Gao, Lei Meng, Qin Tong

{"title":"[1,n]-因子和{K2,Ci≥4}-因子的紧密韧性、孤立韧性和结合数界限","authors":"Xiao Xu, Zhuoma Gao, Lei Meng, Qin Tong","doi":"10.1142/s021926592350010x","DOIUrl":null,"url":null,"abstract":"Let [Formula: see text] be an integer. The [Formula: see text]-factor of a graph [Formula: see text] is a spanning subgraph [Formula: see text] if [Formula: see text] for all [Formula: see text], and the [Formula: see text]-factor is a subgraph whose each component is either [Formula: see text] or [Formula: see text]. In this paper, we give the lower bounds with regard to tight toughness, isolated toughness and binding number to guarantee the existence of the [Formula: see text]-factors and [Formula: see text]-factors for a graph.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":"27 1","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2023-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Tight Toughness, Isolated Toughness and Binding Number Bounds for the [1,n]-Factors and the {K2,Ci≥4}-Factors\",\"authors\":\"Xiao Xu, Zhuoma Gao, Lei Meng, Qin Tong\",\"doi\":\"10.1142/s021926592350010x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let [Formula: see text] be an integer. The [Formula: see text]-factor of a graph [Formula: see text] is a spanning subgraph [Formula: see text] if [Formula: see text] for all [Formula: see text], and the [Formula: see text]-factor is a subgraph whose each component is either [Formula: see text] or [Formula: see text]. In this paper, we give the lower bounds with regard to tight toughness, isolated toughness and binding number to guarantee the existence of the [Formula: see text]-factors and [Formula: see text]-factors for a graph.\",\"PeriodicalId\":53990,\"journal\":{\"name\":\"JOURNAL OF INTERCONNECTION NETWORKS\",\"volume\":\"27 1\",\"pages\":\"\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2023-06-21\",\"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/s021926592350010x\",\"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/s021926592350010x","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好友复制链接

本刊更多论文

Tight Toughness, Isolated Toughness and Binding Number Bounds for the [1,n]-Factors and the {K2,Ci≥4}-Factors

Let [Formula: see text] be an integer. The [Formula: see text]-factor of a graph [Formula: see text] is a spanning subgraph [Formula: see text] if [Formula: see text] for all [Formula: see text], and the [Formula: see text]-factor is a subgraph whose each component is either [Formula: see text] or [Formula: see text]. In this paper, we give the lower bounds with regard to tight toughness, isolated toughness and binding number to guarantee the existence of the [Formula: see text]-factors and [Formula: see text]-factors for a 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.

期刊最新文献

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