Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs

The generalized recursive circulant networking can be widely used in the design and implementation of interconnection networks. It consists of a series of processors, each is connected through bidirectional, point-to-point communication channels to different neighbors. In this work, we apply the shortest path routing concept to build independent spanning trees on the generalized recursive circulant graphs. The proposed strategy loosen the restricted conditions in previous research and extended the result to a more general vertex setting by design the specific algorithm to deal with the constraint issue.

[1]  Alon Itai,et al.  The Multi-Tree Approach to Reliability in Distributed Networks , 1988, Inf. Comput..

[2]  Francis T. Boesch,et al.  A general class of invulnerable graphs , 1972, Networks.

[3]  Ralf Klasing,et al.  Top-Down Construction of Independent Spanning Trees in Alternating Group Networks , 2020, IEEE Access.

[4]  Jou-Ming Chang,et al.  Constructing Multiple Independent Spanning Trees on Recursive circulant Graphs G(2M, 2) , 2010, Int. J. Found. Comput. Sci..

[5]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[6]  Sun-Yuan Hsieh,et al.  Constructing Independent Spanning Trees on Transposition Networks , 2020, IEEE Access.

[7]  M. Klin,et al.  The isomorphism problem for circulant graphs via Schur ring theory , 1999, Codes and Association Schemes.

[8]  Jou-Ming Chang,et al.  On the independent spanning trees of recursive circulant graphs G(cdm, d) with d>2 , 2009, Theor. Comput. Sci..

[9]  Ralph Tindell,et al.  Circulants and their connectivities , 1984, J. Graph Theory.

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

[11]  Alon Itai,et al.  Three tree-paths , 1989, J. Graph Theory.

[12]  Brian Alspach,et al.  The hamilton spaces of cayley graphs on abelian groups , 1990, Discret. Math..

[13]  Bernard Mans.  Optimal Distributed Algorithms in Unlabeled Tori and Chordal Rings , 1997, J. Parallel Distributed Comput..

[14]  Jou-Ming Chang,et al.  Broadcasting secure messages via optimal independent spanning trees in folded hypercubes , 2011, Discret. Appl. Math..

[15]  B. Elspas,et al.  Graphs with circulant adjacency matrices , 1970 .

[16]  Sun-Yuan Hsieh,et al.  Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks , 2019, J. Comb. Optim..

[17]  Jianxi Fan,et al.  Constructing completely independent spanning trees in crossed cubes , 2017, Discret. Appl. Math..

[18]  Yoshihide Igarashi,et al.  Reliable broadcasting and secure distributing in channel networks , 1997, Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97).

[19]  Yue-Li Wang,et al.  Generalized Recursive Circulant Graphs , 2012, IEEE Transactions on Parallel and Distributed Systems.

[20]  Dun-Wei Cheng,et al.  Constructing Independent Spanning Trees on Pancake Networks , 2020, IEEE Access.

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