Reliability Analysis of Hypercube Networks and Folded Hypercube Networks
L. B. Guo · WSEAS Transactions on Mathematics archive · 2017
A network is often modeled by a graph G VE = (, ) with the vertices representing nodes such as processors or stations, and the edges representing links between the nodes. One fundamental consideration in the design of networks is reliability. Let G be a connected graph and P be graph-theoretic property. The conditional connectivity λ(,) G P or κ(,) G P is the minimum cardinality of a set of edges or vertices, if it exists, whose deletion disconnects G and each remaining component has property P . Let F be a vertex set or edge set of G and P be the property of G F− with at least r components. Then we have r -component connectivity ( ) r c G κ and the r -component edge connectivity ( ) r c G λ . In this paper, we determine the r - component edge connectivity of hypercubes and folded hypercubes.