Najibeh Shahbaznejad

collaborators

2 papers

math.CO2021

Some Families of Graphs with Small Power Domination Number

Najibeh Shahbaznejad, Adel P Kazemi, Ignacio M Pelayo

Let $G$ be a graph with the vertex set $V (G)$ and $S$ be a subset of $V (G)$ . Let $c l (S)$ be the set of vertices built from $S$ , by iteratively applying the following propag…

math.CO2019

Zero Forcing sets and Power Dominating sets of cardinality at most 2

Najibeh Shahbaznejad, Ignacio M. Pelayo, Adel P. Kazemi

Let $S$ be a set of vertices of a graph $G$ . Let $c l (S)$ be the set of vertices built from $S$ , by iteratively applying the following propagation rule: if a vertex and all but exac…