%0 Journal Article %1 eskiizmirlileredgeneighbor %A Eskiizmirliler, Saadet %A cioğlu, Zeynep Örs Yorgan %A Polat, Refet %A Gürsoy, Mehmet Ümit %D 2018 %J Applied Mathematics and Sciences: An International Journal (MathSJ) %K Edge-neighbor-rupture Reliability Thorny Vulnerability degree graphs %N 1/2/3 %P 01 - 10 %T EDGE-NEIGHBOR RUPTURE DEGREE ON GRAPH OPERATIONS %U https://airccse.com/mathsj/papers/5318mathsj01.pdf %V 5 %X 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 be
 =  
−  − || − 
− : ⊆ 
, 
−  ≥ 1 where 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 we give some results for the edge-neighbor-rupture degree of the graph operations and Thorny graph types are examined.

@article{eskiizmirlileredgeneighbor, abstract = {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 be
 =  
−  − || − 
− : ⊆ 
, 
−  ≥ 1 where 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 we give some results for the edge-neighbor-rupture degree of the graph operations and Thorny graph types are examined. }, added-at = {2020-11-25T10:53:43.000+0100}, author = {Eskiizmirliler, Saadet and cioğlu, Zeynep Örs Yorgan and Polat, Refet and Gürsoy, Mehmet Ümit}, biburl = {https://www.bibsonomy.org/bibtex/28741529f83d8c91b168d8975b9e2dd7a/journalmathsj}, interhash = {0c6ad6611ca3ef1635d23709b2e53d98}, intrahash = {8741529f83d8c91b168d8975b9e2dd7a}, journal = {Applied Mathematics and Sciences: An International Journal (MathSJ)}, keywords = {Edge-neighbor-rupture Reliability Thorny Vulnerability degree graphs}, month = {September}, number = {1/2/3}, pages = {01 - 10}, timestamp = {2020-11-25T10:53:43.000+0100}, title = {EDGE-NEIGHBOR RUPTURE DEGREE ON GRAPH OPERATIONS}, url = {https://airccse.com/mathsj/papers/5318mathsj01.pdf}, volume = 5, year = 2018 }