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.

• 若图G小去掉任何k条边后所得的图含有生成子图同构于G0，则称G关于G0；