Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs

Abstract

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.

Keywords

• Independent spanning trees
• generalized recursive circulant graphs
• interconnection networks