Structure connectivity and substructure connectivity of k-ary n-cube networks

Abstract The k-ary n-cube is one of the most attractive interconnection networks for parallel and distributed computing system. In this paper, we investigate the fault-tolerant capabilities of k-ary n-cubes with respect to the structure connectivity and substructure connectivity. Let H is a connected graph. The structure connectivity of a graph G, denoted by κ(G; H), is the minimum cardinality of a set of connected subgraphs in G, whose deletion disconnects the graph G and every element in the set is isomorphic to H. The substructure connectivity of a graph G, denoted by κs(G; H), is the minimum cardinality of a set of connected subgraphs in G, whose deletion disconnects the graph G and every element in the set is isomorphic to a connected subgraph of H. We show κ ( Q n k ; H ) and κ s ( Q n k ; H ) for each H ∈ {K1, K1, 1, K1, 2, K1, 3}.

[1]  Shiying Wang,et al.  Many-to-many disjoint path covers in kk-ary nn-cubes , 2013, Theor. Comput. Sci..

[2]  Iain A. Stewart,et al.  Bipancyclicity in k-Ary n-Cubes with Faulty Edges under a Conditional Fault Assumption , 2011, IEEE Transactions on Parallel and Distributed Systems.

[3]  Shekhar Y. Borkar,et al.  iWarp: an integrated solution to high-speed parallel computing , 1988, Proceedings. SUPERCOMPUTING '88.

[4]  Khaled Day,et al.  The Conditional Node Connectivity Of The k-Ary n-Cube , 2004, J. Interconnect. Networks.

[5]  Michael D. Noakes,et al.  The J-machine multicomputer: an architectural evaluation , 1993, ISCA '93.

[6]  Kai Feng,et al.  Strong matching preclusion for k-ary n-cubes , 2013, Discret. Appl. Math..

[7]  Iain A. Stewart,et al.  Bipanconnectivity and Bipancyclicity in k-ary n-cubes , 2009, IEEE Transactions on Parallel and Distributed Systems.

[8]  Shin-Shin Kao,et al.  One-to-one disjoint path covers on k-ary n-cubes , 2011, Theor. Comput. Sci..

[9]  R. E. Kessler,et al.  Cray T3D: a new dimension for Cray Research , 1993, Digest of Papers. Compcon Spring.

[10]  Jywe-Fei Fang.  The Bipancycle-Connectivity and the m-Pancycle-Connectivity of the k-ary n-cube , 2010, Comput. J..

[11]  Xiaofan Yang,et al.  Embedding paths and cycles in 3-ary n-cubes with faulty nodes and links , 2010, Inf. Sci..

[12]  Cheng-Kuan Lin,et al.  Graph Theory and Interconnection Networks , 2008 .

[13]  Sun-Yuan Hsieh,et al.  Extraconnectivity of k-ary n-cube networks , 2012, Theor. Comput. Sci..

[14]  Saïd Bettayeb.  On the k-ary Hypercube , 1995, Theor. Comput. Sci..

[15]  Yaagoub Ashir,et al.  Lee Distance and Topological Properties of k-ary n-cubes , 1995, IEEE Trans. Computers.

[16]  Yuxing Yang,et al.  Hamiltonian path embeddings in conditional faulty k-ary n-cubes , 2014, Inf. Sci..

[17]  Yaagoub Ashir,et al.  On Embedding Cycles in k-Ary n-Cubes , 1997, Parallel Process. Lett..

[18]  Jing Li,et al.  Conditional connectivity of recursive interconnection networks respect to embedding restriction , 2014, Inf. Sci..

[19]  Sun-Yuan Hsieh,et al.  The Conditional Diagnosability of k-Ary n-Cubes under the Comparison Diagnosis Model , 2013, IEEE Trans. Computers.

[20]  Abdel Elah Al-Ayyoub,et al.  Fault Diameter of k-ary n-cube Networks , 1997, IEEE Trans. Parallel Distributed Syst..

[21]  Xiaohui Huang,et al.  A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs , 2013, Inf. Sci..

[22]  Abdol-Hossein Esfahanian,et al.  Generalized Measures of Fault Tolerance with Application to N-Cube Networks , 1989, IEEE Trans. Computers.

[23]  Cheng-Kuan Lin,et al.  Structure connectivity and substructure connectivity of hypercubes , 2016, Theor. Comput. Sci..

[24]  Sun-Yuan Hsieh,et al.  Panconnectivity and edge-pancyclicity of k-ary n-cubes , 2009 .

[25]  Kai Feng,et al.  Fault tolerance in k-ary n-cube networks , 2012, Theor. Comput. Sci..

[26]  E. Anderson,et al.  Performance of the CRAY T3E Multiprocessor , 1997, ACM/IEEE SC 1997 Conference (SC'97).

[27]  Shahram Latifi,et al.  Conditional Connectivity Measures for Large Multiprocessor Systems , 1994, IEEE Trans. Computers.

[28]  Jimmy J. M. Tan,et al.  Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes , 2007, J. Parallel Distributed Comput..

[29]  Jixiang Meng,et al.  Extraconnectivity of hypercubes , 2009, Appl. Math. Lett..

[30]  Iain A. Stewart,et al.  Embedding Long Paths in k-Ary n-Cubes with Faulty Nodes and Links , 2008, IEEE Transactions on Parallel and Distributed Systems.