Nazanin Movarraei

activity

20142024

collaborators

4 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.CO2021

On the Chromatic Vertex Stability Number of Graphs

Saieed Akbari, Arash Beikmohammadi, Sandi Klavžar +1

The chromatic vertex (resp.\ edge) stability number $vs_{χ} (G)$ (resp.\ $es_{χ} (G)$ ) of a graph $G$ is the minimum number of vertices (resp.\ edges) whose deletion results…

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…

math.CO2014

On the Number of cycles in a Graph

Nazanin Movarraei

In this paper, we obtain explicit formulae for the number of 7-cycles and the total number of paths of lengths 6 and 7 those contain a specific vertex $v_{i}$ in a simple graph G,…

On the Δ-edge stability number of graphs

On the Chromatic Vertex Stability Number of Graphs

Critical graphs for the chromatic edge-stability number

On the Number of cycles in a Graph

On the $Δ$ -edge stability number of graphs