Given a (directed ) graph H, a (directed) graph G is ak-edge fault-tolerantgraph with respect to H, denoted k-EFT (H)graph, if G contains a spanning subgraph isomorphic to H after theremoval of any k edges from G.

• 给定一个（有向）图H，称（有向）图G为关于H的k-边容错图，记为k－EHT（H）图，若从G中移去任何k条边所得的每个图都含有生成子图同构于H。