Conditional connectivity measures for large multiprocessor systems

S. Latifi, M.V. Hegde, Mort Naraghi‐Pour

IEEE Transactions on Computers · 1994 · 336 citations · 7 references

Concepts

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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

References

7