Reliability measures of crossed cube networks
L. B. Guo · 2018
Since the growing size of networks increases their vulnerability to component failures, fault tolerance is specially vital for interconnection networks. In the case of vertex failures, the connectivity is a classical measure for the fault tolerance of a network. Assume G = (V, E) is a connected graph. F⊆ E is a subset, if G - F is not connected and minimum degree δG-F≥ k, then we call F is a k-restricted edge cut. k-restricted edge connectivity λk(G) is the number of edges in a minimum k-restricted edge cut. The k-restricted vertex connectivity Kk(G) can be defined similarly. The k-restricted edge or vertex connectivity of crossed cubes CQnfor small k are determined. And we also prove other properties of CQn.