交替群图的结构连通性和子结构连通性

Lantao You, Yuejuan Han, Xi Wang, Chen Zhou, Rui Gu, Chen Lu
{"title":"交替群图的结构连通性和子结构连通性","authors":"Lantao You, Yuejuan Han, Xi Wang, Chen Zhou, Rui Gu, Chen Lu","doi":"10.1109/PIC.2018.8706296","DOIUrl":null,"url":null,"abstract":"The alternating group graph, denoted by AGn, is one of the popular interconnection networks. In this paper, we consider two network connectivities, H-structure-connectivity and H-substructure-connectivity, which are new measures for a network’s reliability and fault-tolerability. We say that a set F of connected subgraphs of G is a subgraph-cut of G if G−V (F) is a disconnected or trivial graph. Let H be a connected subgraph of G. Then F is an H-structure-cut, if F is a subgraph-cut, and every element in F is isomorphic to H. And F is an H-substructure-cut if F is a subgraph-cut, such that every element in F is isomorphic to a connected subgraph of H. The H-structure-connectivity(resp. H-substructure-connectivity) of G, denoted by κ(G;H)(resp. κs(G;H)), is the minimum cardinality of all H-structure-cuts(resp. H-substructure-cuts) of G. In this paper, we will establish both κ(AGn;H) and κ(AGn;H) for the alternating group graph AGn and H ∈{K1,K1,1,K1,2}.","PeriodicalId":236106,"journal":{"name":"2018 IEEE International Conference on Progress in Informatics and Computing (PIC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Structure Connectivity and Substructure Connectivity of Alternating Group Graphs\",\"authors\":\"Lantao You, Yuejuan Han, Xi Wang, Chen Zhou, Rui Gu, Chen Lu\",\"doi\":\"10.1109/PIC.2018.8706296\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The alternating group graph, denoted by AGn, is one of the popular interconnection networks. In this paper, we consider two network connectivities, H-structure-connectivity and H-substructure-connectivity, which are new measures for a network’s reliability and fault-tolerability. We say that a set F of connected subgraphs of G is a subgraph-cut of G if G−V (F) is a disconnected or trivial graph. Let H be a connected subgraph of G. Then F is an H-structure-cut, if F is a subgraph-cut, and every element in F is isomorphic to H. And F is an H-substructure-cut if F is a subgraph-cut, such that every element in F is isomorphic to a connected subgraph of H. The H-structure-connectivity(resp. H-substructure-connectivity) of G, denoted by κ(G;H)(resp. κs(G;H)), is the minimum cardinality of all H-structure-cuts(resp. H-substructure-cuts) of G. In this paper, we will establish both κ(AGn;H) and κ(AGn;H) for the alternating group graph AGn and H ∈{K1,K1,1,K1,2}.\",\"PeriodicalId\":236106,\"journal\":{\"name\":\"2018 IEEE International Conference on Progress in Informatics and Computing (PIC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE International Conference on Progress in Informatics and Computing (PIC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIC.2018.8706296\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Progress in Informatics and Computing (PIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIC.2018.8706296","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

交替群图是一种常用的互连网络,用AGn表示。本文考虑了两种网络连通性:h结构连通性和h子结构连通性,它们是衡量网络可靠性和容错性的新指标。如果G−V (F)是一个不连通图或平凡图,我们说G的连通子图集合F是G的子图切。设H是g的连通子图,则F是H结构切,如果F是子图切,且F中的每个元素与H同构;如果F是子图切,使得F中的每个元素与H的连通子图同构,则F是H结构切。G的H-子结构-连通性),用κ(G;H)表示。κs(G;H)),是所有H结构切割的最小基数。本文将建立交替群图AGn和H∈{K1,K1,1,K1,2}的κ(AGn;H)和κ(AGn;H)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Structure Connectivity and Substructure Connectivity of Alternating Group Graphs
The alternating group graph, denoted by AGn, is one of the popular interconnection networks. In this paper, we consider two network connectivities, H-structure-connectivity and H-substructure-connectivity, which are new measures for a network’s reliability and fault-tolerability. We say that a set F of connected subgraphs of G is a subgraph-cut of G if G−V (F) is a disconnected or trivial graph. Let H be a connected subgraph of G. Then F is an H-structure-cut, if F is a subgraph-cut, and every element in F is isomorphic to H. And F is an H-substructure-cut if F is a subgraph-cut, such that every element in F is isomorphic to a connected subgraph of H. The H-structure-connectivity(resp. H-substructure-connectivity) of G, denoted by κ(G;H)(resp. κs(G;H)), is the minimum cardinality of all H-structure-cuts(resp. H-substructure-cuts) of G. In this paper, we will establish both κ(AGn;H) and κ(AGn;H) for the alternating group graph AGn and H ∈{K1,K1,1,K1,2}.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信