Diameter vulnerability of iterated line digraphs

Abstract Because of their good properties, iterated line digraphs (specially Kautz and de Bruijn digraphs) have been considered to design interconnection networks. The diameter-vulnerability of a digraph is the maximum diameter of the subdigraphs obtained by deleting a fixed number of vertices or arcs. For any digraph G, we find a constant C (not greater than twice the diameter of G) such that, under certain conditions, the diameter vulnerability of the iterated line digraph Lk G is at most the diameter of Lk G plus C. The results in this paper generalize previous results on the diameter-vulnerability of particular families of iterated line digraphs (Kautz and de Bruijn digraphs).