A new graph parameter, edge neighbor toughness is introduced to measure how difficult it for a be broken into many components through the deletion of closed neighborhoods few edges. Let G=(V,E) graph. An e said subverted when its neighborhood and two endvertices are deleted from G. set S⊆E(G) called an cut-strategy if all edges in S has been G survival subgraph, denoted by G/S, disconnected, or...