Edge fault-diameter of graph product.
The product graph B ¤ F of graphs B and F is an interesting model in the design of large reliable networks. Let G be a kG-edge connected graph and DE c (G) be the largest diameter of subgraphs of G obtained by deleting c < kG edges. We prove that DE a+b+1(B ? F) · DE a (F) + DE b (B) + 1 where a < kF , and b < kB.