Edge-Neighbor Rupture Degree on Graph Operations
Edge-Neighbor Rupture Degree on Graph Operations is a scholarly work, published in 2018 in ''Applied Mathematics and Sciences An International Journal (MathSJ)''. The main subjects of the publication include Enhanced Data Rates for GSM Evolution, distributed constrained optimisation problem, graph, artificial intelligence, Graph matching, graph theory, combinatorics, mathematics, degree, and computer science. 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 , say , is a set of edge(s) in whose adjacent vertices which is incident with the removal edge(s) are removed from .The survival subgraph is denoted by -.The edgeneighbor-rupture degree of connected graph , , is defined to bewhere is any edge-cut-strategy of , is the number of the components of -, and is the maximum order of the components of -.In this paper authors give some results for the edge-neighbor-rupture degree of the graph operations and Thorny graph types are examined.