Diameter vulnerability of iterated line digraphs (Q1910577): Difference between revisions

The diameter vulnerability of a digraph is the maximum diameter of the subdigraphs obtained by deleting a fixed number of nodes or arcs. For a given digraph \(G\), it is shown that there is a constant \(C\), not greater than twice the diameter of \(G\) such that, under certain conditions, the diameter vulnerability of the iterated line digraph \(L^k G\) is at most the diameter of \(L^k G\) plus \(C\). This result generalizes previous results on the diameter vulnerability of families of Kautz and de Bruijn digraphs.