E. Nazari

collaborators

4 papers

math.CO2018

Domination Critical Knodel Graphs

D. A. Mojdeh, S. R. Musawi, E. Nazari

A set $D$ of vertices of a graph $G$ is a dominating set if each vertex of $V (G) ∖ D$ is adjacent to some vertex of $D$ . The domination number of $G$ , $γ (G)$ , is the minimum…

math.CO2018

On the distance domination number of bipartite graphs

D. A. Mojdeh, S. R. Musawi, E. Nazari

A subset $D \subseteq V (G)$ is called a $k$ -distance dominating set of $G$ if every vertex in $V (G) ∖ D$ is within distance $k$ from some vertex of $D$ . The minimum cardinali…

math.CO2018

Domination in 4-regular Knödel graphs

Doost Ali Mojdeh, Seyed Reza Musawi, Esmaeil Nazari

A subset $D$ of vertices of a graph $G$ is a dominating set if for each $u \in V (G) ∖ D$ , $u$ is adjacent to some vertex $v \in D$ . The domination number, $γ (G)$ of $G$ , is th…

math.CO2018

Total domination in cubic Knödel graphs

Doost Ali Mojdeh, Seyed Reza Musawi, Esmaeil Nazari +1

A subset $D$ of vertices of a graph $G$ is a \textit{dominating set} if for each $u \in V (G) ∖ D$ , $u$ is adjacent to some vertex $v \in D$ . The \textit{dominating number}, $γ…