The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Let f(t,k) be the maximum diameter of graphs obtained by deleting t edges from a (t+1)-edge-connected graph with diameter k. This paper shows 42t−6<f(t,3)≤max{59,52t+7} for t≥4, which corrects an improper result in [C. Peyrat, Diameter vulnerability of graphs, Discrete Appl. Math. 9 (3) (1984) 245–250] and also determines f(2,k)=3k−1 and f(3,k)=4k−2 for k≥3.