Let G and G, be graphs on n nodcs. G is k -edge fault tolerant with respect to Go, denoted by k -EFT(G0), if every graph obtained by removing any k edges from Gcontains a subgraph Go.