Journal ArticleDOI
Conditional connectivity measures for large multiprocessor systems
TLDR
The vertex connectivity for the n-dimensional cube is obtained, and the minimal sets of faulty nodes that disconnect the cube are characterized.Abstract:
Introduces a new measure of conditional connectivity for large regular graphs by requiring each vertex to have at least g good neighbors in the graph. Based on this requirement, the vertex connectivity for the n-dimensional cube is obtained, and the minimal sets of faulty nodes that disconnect the cube are characterized. >read more
Citations
More filters
Book
Topological Structure and Analysis of Interconnection Networks
TL;DR: This book provides the most basic problems, concepts, and well-established results from the topological structure and analysis of interconnection networks in the graph-theoretic language for undergraduates and postgraduates specializing in computer science and applied mathematics.
Journal ArticleDOI
Conditional diagnosability measures for large multiprocessor systems
TL;DR: A new measure of diagnosable, called conditional diagnosability, is introduced, by restricting that any faulty set cannot contain all the neighbors of any vertex in the graph, which shows the conditional Diagnosability of the n-dimensional hypercube to be 4(n - 2) +1, which is about four times as large as the classical diagnosis.
Journal ArticleDOI
The g-good-neighbor conditional diagnosability of hypercube under PMC model
TL;DR: The g -good-neighbor conditional diagnosability of Q n is several times larger than the classical diagnosable, and is proved to be 4( n − 2) + 1 under the PMC model.
Journal ArticleDOI
The ${\schmi g}$ -Good-Neighbor Conditional Diagnosability of ${\schmi k}$ -Ary ${\schmi n}$ -Cubes under the PMC Modeland MM* Model
TL;DR: This study shows the g-good-neighbor conditional diagnosable of k-ary n-cube is several times larger than the classical diagnosability of k/s n, which is a family of popular networks.
Journal ArticleDOI
Extraconnectivity of hypercubes
Weihua Yang,Jixiang Meng +1 more
TL;DR: This work determines κ g ( Q n ) for 0 ≤ g ≤ n, n ≥ 4 , where Q n denotes the n -dimensional hypercube.
References
More filters
Book
Graph theory with applications
TL;DR: In this paper, the authors present Graph Theory with Applications: Graph theory with applications, a collection of applications of graph theory in the field of Operational Research and Management. Journal of the Operational research Society: Vol. 28, Volume 28, issue 1, pp. 237-238.
Journal ArticleDOI
The cosmic cube
TL;DR: Cosmic Cube as discussed by the authors is a hardware simulation of a future VLSI implementation that will consist of single-chip nodes, which offers high degrees of concurrency in applications and suggests that future machines with thousands of nodes are both feasible and attractive.