scientific article; zbMATH DE number 4008432

From MaRDI portal
Publication:3758865





[For the entire collection see Zbl 0619.00022.] We consider the following problem: Given positive integers k and D, what is the maximum diameter of the graph obtained by deleting k edges from a graph G with diameter D, assuming that the resulting graph is still connected. For undirected graphs G we prove an upper bound of \((k+1)D\) and a lower bound of \((k+1)D-k\) for even D and of \((k+1)D-2k+2\) for odd \(D\geq 3\). For directed graphs G, the bounds depend strongly on D: for \(D=1\) and \(D=2\) we derive exact bounds of \(\theta\) (\(\sqrt{k})\) and of 2k-2, respectively, while for \(D\geq 3\) the resulting diameter is in general unbounded in terms of k and D.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3758865)