The 4-Component Connectivity of Alternating Group Networks

Abstract The l-component connectivity (or l-connectivity for short) of a graph G, denoted by κ l ( G ) , is the minimum number of vertices whose removal from G results in a disconnected graph with at least l components or a graph with fewer than l vertices. This generalization is a natural extension of the classical connectivity defined in term of minimum vertex-cut. As an application, the l-connectivity can be used to assess the vulnerability of a graph corresponding to the underlying topology of an interconnection network, and thus is an important issue for reliability and fault tolerance of the network. So far, only a little knowledge of results have been known on l-connectivity for particular classes of graphs and small l's. In a previous work, we studied the l-connectivity on n-dimensional alternating group networks A N n and obtained the result κ 3 ( A N n ) = 2 n − 3 for n ⩾ 4 . In this sequel, we continue the work and show that κ 4 ( A N n ) = 3 n − 6 for n ⩾ 4 .

[1]  Hong-Jian Lai,et al.  Minimally ( k, k )-edge-connected graphs , 2003 .

[2]  Eddie Cheng,et al.  Connectivity Results of Hierarchical Cubic Networks as Associated with Linearly Many Faults , 2014, 2014 IEEE 17th International Conference on Computational Science and Engineering.

[3]  Gen-Huey Chen,et al.  Longest Fault-Free Paths in Star Graphs with Edge Faults , 2001, IEEE Trans. Computers.

[4]  Ortrud R. Oellermann.  On thel-connectivity of a graph , 1987, Graphs Comb..

[5]  Yuefang Sun,et al.  On the difference of two generalized connectivities of a graph , 2017, J. Comb. Optim..

[6]  Deying Li,et al.  Minimally (k, k-1)-edge-connected graphs , 2003, Australas. J Comb..

[7]  Wenjun Xiao,et al.  Internode Distance and Optimal Routing in a Class of Alternating Group Networks , 2006, IEEE Transactions on Computers.

[8]  Xueliang Li,et al.  A survey on the generalized connectivity of graphs , 2012, ArXiv.

[9]  Cheng-Kuan Lin,et al.  Component connectivity of the hypercubes , 2012, Int. J. Comput. Math..

[10]  Hao Jin,et al.  Characterize a Kind of Fault Tolerance of Alternating Group Network , 2012 .

[11]  Kung-Jui Pai,et al.  Two Kinds of Generalized 3-Connectivities of Alternating Group Networks , 2018, FAW.

[12]  Sheldon B. Akers,et al.  The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[13]  Michael Hager,et al.  Pendant tree-connectivity , 1985, J. Comb. Theory, Ser. B.

[14]  Chun-Hua Chen,et al.  Pancyclicity on Möbius cubes with maximal edge faults , 2004, Parallel Comput..

[15]  Eddie Cheng,et al.  Structural Properties of Generalized Exchanged Hypercubes , 2017 .

[16]  Shuming Zhou,et al.  Conditional diagnosability of alternating group networks , 2010, Inf. Process. Lett..

[17]  Shuming Zhou,et al.  Construction of vertex-disjoint paths in alternating group networks , 2009, The Journal of Supercomputing.

[18]  Junming Xu.  Topological Structure and Analysis of Interconnection Networks , 2002, Network Theory and Applications.

[19]  Xueliang Li,et al.  Generalized Connectivity of Graphs , 2016 .

[20]  Eddie Cheng,et al.  Connectivity Results of Complete Cubic Networks as Associated with Linearly Many Faults , 2015, J. Interconnect. Networks.

[21]  Ortrud R. Oellermann,et al.  Bounds on the size of graphs of given order and up/down-connectivity , 1999, Discret. Math..

[22]  S. Lakshmivarahan,et al.  A new class of interconnection networks based on the alternating group , 1993, Networks.

[23]  Frank Harary,et al.  Conditional connectivity , 1983, Networks.

[24]  F. Boesch,et al.  A Generalization of Line Connectivity and Optimally Invulnerable Graphs , 1978 .