EDGE-NEIGHBOR RUPTURE DEGREE ON GRAPH OPERATIONS

Vulnerability and reliability parameters measure the resistance of the network to disruption of operation after the failure of certain stations or communication links in a communication network. An edge subversion strategy of a graph G, say , is a set of edge(s) in G whose adjacent vertices which is incident with the removal edge(s) are removed from G. In this paper we give some results for the edge-neighbor-rupture degree of the graph operations and Thorny graph types are examined.