Restricted Edge-Connectivity of de Bruijn Digraphs
Jun‐Ming Xu, Min Lü · 2015
The restricted edge-connectivity of a graph is an important parameter to measure fault-tolerance of interconnection networks. This paper determines that the restricted edge-connectivity of the de Bruijn digraph B(d, n) is equal to 2d − 2 for d ≥ 2 and n ≥ 2 except B(2, 2). As conse-quences, the super edge-connectedness of B(d, n) is obtained immediately.