Structure connectivity and substructure connectivity of the directed k-ary n-cube

IF 0.6 Q4 COMPUTER SCIENCE, THEORY & METHODS
Yu Wang, J. Meng
{"title":"Structure connectivity and substructure connectivity of the directed k-ary n-cube","authors":"Yu Wang, J. Meng","doi":"10.1080/17445760.2022.2110592","DOIUrl":null,"url":null,"abstract":"Given a strongly connected digraph D and a connected subdigraph T of D, the T-structure connectivity of D is the cardinality of a minimum set of subdigraphs in D, whose removal results in a non-strongly connected digraph and . The T-substructure connectivity of D is the cardinality of a minimum set of subdigraphs in D, whose removal results in a non-strongly connected digraph and each element is isomorphic to a connected subdigraph of T. In this work, we study resp. for , and ; resp. for and ; and resp. for , , and , where is the directed k-ary n-cube, is the in-star on t + 1 vertices, and are, respectively, the directed path and cycle of length t.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2022-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Parallel Emergent and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/17445760.2022.2110592","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

Abstract

Given a strongly connected digraph D and a connected subdigraph T of D, the T-structure connectivity of D is the cardinality of a minimum set of subdigraphs in D, whose removal results in a non-strongly connected digraph and . The T-substructure connectivity of D is the cardinality of a minimum set of subdigraphs in D, whose removal results in a non-strongly connected digraph and each element is isomorphic to a connected subdigraph of T. In this work, we study resp. for , and ; resp. for and ; and resp. for , , and , where is the directed k-ary n-cube, is the in-star on t + 1 vertices, and are, respectively, the directed path and cycle of length t.
有向k-元n-立方体的结构连通性和子结构连通性
给定D的一个强连通有向图D和一个连通子图T,D的T-结构连通性是D中一个最小子图集的基数,其移除导致一个非强连通有向无。D的T-子结构连通性是D中最小子图集的基数,其移除导致非强连通有向图,并且每个元素同构于T的连通子图。用于、和;分别。为和;和resp。对于,和,其中是有向k元n立方体,是t上的in星 + 1个顶点,和分别是长度为t的有向路径和循环。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
2.30
自引率
0.00%
发文量
27
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信