New bounds on the diameter vulnerability of iterated line digraphs (Q5936021)
From MaRDI portal
scientific article; zbMATH DE number 1612881
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New bounds on the diameter vulnerability of iterated line digraphs |
scientific article; zbMATH DE number 1612881 |
Statements
New bounds on the diameter vulnerability of iterated line digraphs (English)
0 references
29 March 2002
0 references
The \(s\)-vertex (arc) diameter vulnerability of a digraph \(G,\kappa (s,G)\) (\(\lambda (s,G)\)) is the maximum of diameters of the subdigraphs obtained by removing at most \(s\) vertices (edges) from \(G.\) In this paper bounds on \(\kappa (s,G)\) and \(\lambda (s,G),\) where \(G\) is an iterated line digraph, are studied.
0 references
vulnerability
0 references
diameter
0 references
line digraph
0 references
