On the $\Delta$-edge stability number of graphs

Saieed Akbari, Reza Hosseini Dolatabadi, Mohsen Jamaali +2

The $\Delta$-edge stability number ${\mathrm{es}}_{\Delta }(G)$ of a graph $G$ is the minimum number of edges of $G$ whose removal results in a subgraph $H$ with $\Delta (H)=\Delta (G)-1$. Sets whose removal…