An edge-neighbor-connectedness network reliability model

et G be a simple and undirected graph with n points and e edges. An edge in graph G is said to be subverted if its endpoints are deleted from G. The edge-neighbor-connectivity of G is defined to be the minimum number of edges required to be subverted in order to disconnect G or to leave G empty or trivial. We consider a network reliability model where edges in G are assigned equal subversion probabilities and function independently of each other. The edge-neighbor-connectedness-reliability R(G) is defined to be the probability that the surviving induced subgraph is non-trivial and connected. In the class...