网络首发
Restricted Arc-connectivity of Generalized De Bruijn Digraphs and Kautz Digraphs
ZHANG Junhao;MENG Jixiang;The restricted arc-connectivity of a digraph is an important parameter to measure fault-tolerance of interconnection networks. This paper determines that the restricted arc-connectivity of the de Bruijn digraph BG(n, d) is equal to 2d-2 for diameter k ≥ 4 and d ≥ 4, and the restricted arc-connectivity of Kautz digraph KG(n, d) is equal to 2d-2 for k ≥ 4, d ≥ 4 or d ≥ 3, k ≥ 5,g.c.d(n, d) ≥ 2 and n is divisible by(d + 1). As consequences, the super restricted arc-connectedness of BG(n, d) and KG(n, d) is obtained immediately. This paper shows that λh(D) ≤ min{ξh(D), |V1|λ(D2), |V2|λ(D1)}. In particular, for diameter k ≥ 4, it can be determined that λ2(BG(n, d) × BG(n, d)) = 4d-2 for d ≥ 3 and λ2(KG(n, d) × KG(n, d)) = 4d-2 for d ≥ 2.