scispace - formally typeset
Journal ArticleDOI

Structure Fault-Tolerance of the Generalized Hypercube

About
This article is published in The Computer Journal.The article was published on 2019-09-01. It has received 18 citations till now. The article focuses on the topics: Hypercube & Fault tolerance.

read more

Citations
More filters
Proceedings Article

The Conditional Node Connectivity of the k-ary n-Cube.

TL;DR: In this article, the authors derived the conditional node connectivity of the k-ary n-cube interconnection network under the condition of forbidden faulty sets (i.e., assuming that each non-faulty processor has at least one non-Faulty neighbor).
Journal ArticleDOI

Structure and Substructure Connectivity of Balanced Hypercubes

TL;DR: The upper bounds forappa (BH_n;K_{1,M}) and κ ( B H n ; K 1, M ) are presented and it is shown that the upper bounds are tight for 1 ≤ M ≤ 5.
Journal ArticleDOI

Structure Fault-tolerance of Arrangement Graphs

TL;DR: This thesis establishes structure connectivity and substructure connectivity of the (n, k)-arrangement graph An,k, which generalize the classical vertex-connectivity.
Journal ArticleDOI

Structure Connectivity and Substructure Connectivity of $k$ -Ary $n$ -Cube Networks

TL;DR: New results on the fault tolerability of k-ary n-cube networks are presented and the structure/substructure connectivity of Q n k networks is concerned, for paths and cycles, two basic yet important network structures.
Journal ArticleDOI

Structure fault tolerance of balanced hypercubes

TL;DR: The main results show that the H-structure and H-substructure connectivity of the n-dimensional balanced hypercube BH is equal to the restricted H-Structure connectivity (resp. H- Substructure Connectivity) of $$\text {BH}_n”.
References
More filters
Journal ArticleDOI

Generalized Hypercube and Hyperbus Structures for a Computer Network

TL;DR: A general class of hypercube structures is presented in this paper for interconnecting a network of microcomputers in parallel and distributed environments and the performance is compared to that of other existing hyper cube structures such as Boolean n-cube and nearest neighbor mesh computers.
Journal ArticleDOI

Generalized measures of fault tolerance with application to N-cube networks

TL;DR: The author presents a fault-tolerance analysis for the n-cube networks that shows that such networks can tolerate up to 2n-3 processor failures and remain connected provided that for each processor p in the network, all the processors which are directly connected to p do not fail at the same time.
Journal ArticleDOI

On the extraconnectivity of graphs

TL;DR: Substantial conditions are given, relating the diameter of G with its girth, to assure optimum values of these conditional connectivities of G.
Journal ArticleDOI

Conditional connectivity measures for large multiprocessor systems

TL;DR: The vertex connectivity for the n-dimensional cube is obtained, and the minimal sets of faulty nodes that disconnect the cube are characterized.