Constructing vertex-disjoint paths in (n, k)-star graphs

This work describes a novel routing algorithm for constructing a container of width n-1 between a pair of vertices in an (n, k)-star graph with connectivity n-1. Since Lin et al. [T.C. Lin, D.R. Duh, H.C. Cheng, Wide diameter of (n, k)-star networks, in: Proceedings of the International Conference on Computing, Communications and Control Technologies, vol. 5, 2004, pp. 160-165] already calculated the wide diameters in (n, n-1)-star and (n, 1)-star graphs, this study only considers an (n, k)-star with 2=

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

[2]  Shahram Latifi.  On the Fault-Diameter of the Star Graph , 1993, Inf. Process. Lett..

[3]  Gen-Huey Chen,et al.  Longest Fault-Free Paths in Star Graphs with Edge Faults , 2001, IEEE Trans. Computers.

[4]  Jung-Sheng Fu,et al.  Node-disjoint paths and related problems on hierarchical cubic networks , 2002, Networks.

[5]  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.

[6]  Adele A. Rescigno,et al.  Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security , 2001, Inf. Sci..

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

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

[9]  Sun-Yuan Hsieh,et al.  The k-degree Cayley graph and its topological properties , 2006, Networks.

[10]  Jung-Sheng Fu.  Longest fault-free paths in hypercubes with vertex faults , 2006, Inf. Sci..

[11]  Shietung Peng,et al.  Node-To-Set Disjoint Paths Problem in Star Graphs , 1997, Inf. Process. Lett..

[12]  Youngjoo Cho,et al.  A parallel routing algorithm on circulant networks employing the Hamiltonian circuit latin square , 2006, Inf. Sci..

[13]  Maw-Sheng Chern,et al.  Designing Parallel Algorithms from Regular Graphs and Semi-Regular Graphs , 1987, ICPP.

[14]  Toru Araki,et al.  Hamiltonian laceability of bubble-sort graphs with edge faults , 2007, Inf. Sci..

[15]  Ren-Hung Hwang,et al.  Modeling and analyzing the performance of adaptive hierarchical networks , 2006, Inf. Sci..

[16]  Sheldon B. Akers,et al.  The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[17]  Chi-Chang Chen,et al.  Nearly optimal one-to-many parallel routing in star networks , 1997, Proceedings 11th International Parallel Processing Symposium.

[18]  D.Frank Hsu,et al.  On Container Width and Length in Graphs, Groups,and Networks--Dedicated to Professor Paul Erdös on the occasion of his 80th birthday-- , 1994 .

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

[20]  Pradip K. Srimani,et al.  Fault Diameter of Star Graphs , 1993, Inf. Process. Lett..

[21]  Gen-Huey Chen,et al.  Longest fault-free paths in star graphs with vertex faults , 2001, Theor. Comput. Sci..

[22]  Lih-Hsing Hsu,et al.  On embedding cycles into faulty twisted cubes , 2006, Inf. Sci..

[23]  Frank Harary,et al.  Distance in graphs , 1990 .

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

[25]  Kyung-Yong Chwa,et al.  New Ring Embedding and its Application into Fault-tolerant Embedding in (n,k)-star Graphs , 2000 .

[26]  Junming Xu.  Topological Structure and Analysis of Interconnection Networks , 2002, Network Theory and Applications.

[27]  Jun-Ming Xu,et al.  On reliability of the folded hypercubes , 2007, Inf. Sci..

[28]  Rza Bashirov,et al.  Analyzing permutation capability of multistage interconnection networks with colored Petri nets , 2006, Inf. Sci..

[29]  Xiaohua Jia,et al.  Complete path embeddings in crossed cubes , 2006, Inf. Sci..

[30]  Jung-Hwan Chang.  Cycle Property in the (n,k)-star Graph , 2000 .

[31]  Chun-Ching Wang,et al.  Fragile Watermarking Algorithm for DCT-Domain Image Authentication and Recompression , 2007 .

[32]  Jung-Sheng Fu,et al.  Combinatorial properties of hierarchical cubic networks , 2001, Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001.

[33]  Jimmy J. M. Tan,et al.  Hyper hamiltonian laceability on edge fault star graph , 2004, Inf. Sci..

[34]  Po-Jen Chuang,et al.  An efficient reconfiguration scheme for fault-tolerant meshes , 2005, Inf. Sci..