Fault tolerance of minimal path routings in a network

We prove the conjectured 2T-1 pound on the diameter of a surviving quote graph from which T edges are removed, under the assumption that a minimal path routing is used we also prove the related conjecture for node failure, and combine the results into a more general theorem.