Generalized Measures of Edge Fault Tolerance in (n,k)-star Graphs
暂无分享,去创建一个
This paper considers a kind of generalized measure $\lambda_s^{(h)}$ of fault tolerance in the $(n,k)$-star graph $S_{n,k}$ for $2\leqslant k \leqslant n-1$ and $0\leqslant h \leqslant n-k$, and determines $\lambda_s^{(h)}(S_{n,k})=\min\{(n-h-1)(h+1), (n-k+1)(k-1)\}$, which implies that at least $\min\{(n-k+1)(k-1),(n-h-1)(h+1)\}$ edges of $S_{n,k}$ have to remove to get a disconnected graph that contains no vertices of degree less than $h$. This result shows that the $(n,k)$-star graph is robust when it is used to model the topological structure of a large-scale parallel processing system.
[1] Wei-Kuo Chiang,et al. The (n, k)-Star Graph: A Generalized Star Graph , 1995, Inf. Process. Lett..
[2] Eddie Cheng,et al. Unidirectional (n, k)-Star Graphs , 2002, J. Interconnect. Networks.
[3] Marc J. Lipman,et al. Increasing the connectivity of the star graphs , 2002, Networks.
[4] Sheldon B. Akers,et al. A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.
[5] Khaled Day,et al. Unidirectional Star Graphs , 1993, Inf. Process. Lett..