E. Vatandoost

most citedMaximum nullity and zero forcing number on cubic graphs

3 citations · 3 across the 2 of their papers we have counts for

collaborators

3 papers

math.CO2019

On the signed domination number of some Cayley graphs

Saeid Alikhani, Fatemeh Ramezani, Ebrahim Vatandoost

A signed dominating function of graph $Γ$ is a function $g : V (Γ) ⟶ {- 1, 1}$ such that $\sum_{u \in N [v]} g (u) > 0$ for each $v \in V (Γ)$ . The signed domination number…

math.CO2017

Maximum nullity of Cayley graph

Ebrahim Vatandoost, Yasser Golkhandy Pour

One of the most interesting problems on maximum nullity (minimum rank) is to characterize $M (G)$ ( $m r (G)$ ) for a graph $G$ . In this regard, many resea…

math.CO2017★ 3 cited

Maximum nullity and zero forcing number on cubic graphs

Saieed Akbari, Ebrahim Vatandoost, Yasser Golkhandy Pour

Let $G$ be a graph. The maximum nullity of $G$ , denoted by $M (G)$ , is defined to be the largest possible nullity over all real symmetric matrices $A$ whose $a_{ij} \neq = 0$ for $i\ne…