Edge-neighbor-rupture degree of graphs (Q1790120): Difference between revisions

Summary: The edge-neighbor-rupture degree of a connected graph \(G\) is defined to be \(\mathrm{ENR}(G)=\max\{\omega(G-S)-|S|-m(G-S):S\subseteq E(G), \omega(G-S)\geq 1\}\), where \(S\) is any edge-cut-strategy of \(G\), \(\omega(G-S)\) is the number of the components of \(G-S\), and \(m(G-S)\) is the maximum order of the components of \(G-S\). 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.