Connectivity of Binary Recursive Networks
Deqiang Wang · Computer Engineering and Science · 2008
Binary recursive networks are a family of interconnection networks with excellent topological properties and network parameters. In this paper, we address the connectivity of binary recursive networks. We prove that there are n vertex disjoint paths between every pair of vertices in any binary recursive network. Using this result we show that the vertex connectivity as well as the edge connectivity of the whole binary recursive network is n.