The edge-neighbor-rupture degree of a connected graph is defined to be , 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, the edge-neighbor-rupture degree of some graphs is obtained and the relations between edge-neighbor-rupture degree and other parameters are determined.
"Edge-Neighbor-Rupture Degree of Graphs." J. Appl. Math. 2013 1 - 5, 2013. https://doi.org/10.1155/2013/783610