Fault-tolerance of (n, k)-star networks

[1]  Jun-Ming Xu,et al.  Generalized measures for fault tolerance of star networks , 2014, Networks.

[2]  Jun-Ming Xu,et al.  Fault-tolerance of ðn; kÞ-star networks q , 2014 .

[3]  Dyi-Rong Duh,et al.  (n-3)-edge-fault-tolerant Weak-pancyclicity of (n, K)-star Graphs , 2014, Theor. Comput. Sci..

[4]  Eddie Cheng,et al.  Strong local diagnosability of (n, k)(n, k)-star graphs and Cayley graphs generated by 2-trees with missing edges , 2013, Inf. Process. Lett..

[5]  Shuming Zhou,et al.  The conditional fault diagnosability of (n, k)-star graphs , 2012, Appl. Math. Comput..

[6]  Jian Wang,et al.  On the bounds of feedback numbers of (n, k)-star graphs , 2012, Inf. Process. Lett..

[7]  Jun-Ming Xu,et al.  Generalized Measures of Edge Fault Tolerance in (n,k)-star Graphs , 2012, 1204.0573.

[8]  Xiaofeng Guo,et al.  A kind of conditional fault tolerance of (n, k)-star graphs , 2010, Inf. Process. Lett..

[9]  Eddie Cheng,et al.  Distance formula and shortest paths for the (n, k)-star graphs , 2010, Inf. Sci..

[10]  Eddie Cheng,et al.  A note on the alternating group network , 2010, The Journal of Supercomputing.

[11]  Iain A. Stewart,et al.  One-to-many node-disjoint paths in (n, k)-star graphs , 2010, Discret. Appl. Math..

[12]  Zhao Zhang,et al.  A kind of conditional vertex connectivity of star graphs , 2009, Appl. Math. Lett..

[13]  Eddie Cheng,et al.  On the surface area of the (n, k)-star graph , 2008, Theor. Comput. Sci..

[14]  Jung-Sheng Fu,et al.  Weak-vertex-pancyclicity of (n, k)-star graphs , 2008, Theor. Comput. Sci..

[15]  Dyi-Rong Duh,et al.  Constructing vertex-disjoint paths in (n, k)-star graphs , 2008, Inf. Sci..

[16]  Cheng-Kuan Lin,et al.  The Spanning Connectivity of the (n, k)-star Graphs , 2006, Int. J. Found. Comput. Sci..

[17]  Jimmy J. M. Tan,et al.  Fault Hamiltonicity and fault Hamiltonian connectivity of the (n, k)‐star graphs , 2003, Networks.

[18]  Eddie Cheng,et al.  Unidirectional (n, k)-Star Graphs , 2002, J. Interconnect. Networks.

[19]  Jin-Soo Kim,et al.  Ring embedding in faulty (n,k)-star graphs , 2001, Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001.

[20]  Wei-Kuo Chiang,et al.  Topological Properties of the (n, k)-Star Graph , 1998, Int. J. Found. Comput. Sci..

[21]  Shahram Latifi,et al.  Conditional Fault Diameter of Star Graph Networks , 1996, J. Parallel Distributed Comput..

[22]  Shuo-Cheng Hu,et al.  Fault tolerance on star graphs , 1997, Proceedings the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis.

[23]  Wei-Kuo Chiang,et al.  The (n, k)-Star Graph: A Generalized Star Graph , 1995, Inf. Process. Lett..

[24]  Shahram Latifi,et al.  Conditional Connectivity Measures for Large Multiprocessor Systems , 1994, IEEE Trans. Computers.

[25]  Khaled Day,et al.  A Comparative Study of Topological Properties of Hypercubes and Star Graphs , 1994, IEEE Trans. Parallel Distributed Syst..

[26]  Abdol-Hossein Esfahanian,et al.  Generalized Measures of Fault Tolerance with Application to N-Cube Networks , 1989, IEEE Trans. Computers.

[27]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.