New bounds on the diameter vulnerability of iterated line digraphs Original Research Article

Iterated line digraphs have some good properties in relation to the design of 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. This parameter is related to the fault-tolerance of interconnection networks. In this work, we introduce some new parameters in order to find new bounds for the diameter vulnerability of general iterated line digraphs.