Diameter vulnerability of graphs by edge deletion

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 4 2 t − 6 < f ( t , 3 ) ≤ max { 59 , 5 2 t + 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 ) = 3 k − 1 and f ( 3 , k ) = 4 k − 2 for k ≥ 3 .