Wide diameter for two families of interconnection networks
Shan Gao, Cong Zhu · Wuhan University Journal of Natural Sciences · 2015
Wide diameter is an important parameter for measuring the reliability and efficiency of interconnection networks. Diameter with width k of a graph G, k-diameter, is defined as the minimum integer d for which there exist at least k internally disjoint paths of length at most d between any two distinct vertices in G. In this paper, we will discuss the wide diameter of two families of interconnection networks and present the bounds of wide diameter of G(G 0,G 1,…,G r−1,L), where $$L = \bigcup\limits_{i = 1}^{r - 1} {M_{i,i + 1} }$$ , M i,i+1 is an arbitrary perfect matching between V (G i ) and V (G i+1 ), and G(G 0,G 1,F), where F = {(u i v i )|1 ⩽ i ⩽ n}∪{(u i v i+1)|1 ⩽ i ⩽ n}, u i ∈ V(G 0), v i ∈ V(G 1). And they are used in practical applications, especially in the distributed and parallel computer networks.