n, is one of the popular interconnection networks. In th'/> Structure Connectivity and Substructure Connectivity of Alternating Group Graphs
首页> 外文会议>International Conference on Progress in Informatics and Computing >Structure Connectivity and Substructure Connectivity of Alternating Group Graphs
【24h】

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}.
机译:交替组图,用AG表示 n ,是流行的互连网络之一。在本文中,我们考虑了两个网络连通性,即H-结构-连通性和H-子结构-连通性,它们是网络可靠性和容错性的新度量。我们说,如果G-V(F)是不连续图或平凡图,则G的连通子图的集合F是G的子图割。令H为G的连通子图。那么,如果F为子图割,则F为H-结构割,并且F中的每个元素与H同构。如果F为a,则F为H-子割。子图割,使得F中的每个元素都与H的连接子图同构。G的H结构连接性(分别为H-子结构连接性),由κ(G; H)(resp。κ表示) s (G; H)),是G的所有H结构切割(分别为H亚结构切割)的最小基数。在本文中,我们将建立两个κ(AG n ; H)和κ(AG n ; H)对于交替组图AG n 和H∈{K 1 ,K 1,1 ,K 1,2 }。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号