Nazanin Movarraei

collaborators

2 papers

math.CO2024

On the $Δ$ -edge stability number of graphs

Saieed Akbari, Reza Hosseini Dolatabadi, Mohsen Jamaali +2

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

math.CO2019

Critical graphs for the chromatic edge-stability number

Boštjan Brešar, Sandi Klavžar, Nazanin Movarraei

The chromatic edge-stability number $es_{χ} (G)$ of a graph $G$ is the minimum number of edges whose removal results in a spanning subgraph $G^{'}$ with $χ (G^{'}) = χ (G) - 1$ . Edge-stabil…

On the Δ-edge stability number of graphs

Critical graphs for the chromatic edge-stability number

On the $Δ$ -edge stability number of graphs