Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call