Hassan Zaherifar

collaborators

2 papers

math.CO2022

Strong domination number of some operations on a graph

Saeid Alikhani, Nima Ghanbari, Hassan Zaherifar

Let $G = (V (G), E (G))$ be a simple graph. A set $D \subseteq V (G)$ is a strong dominating set of $G$ , if for every vertex $x \in V (G) ∖ D$ there is a vertex $y \in D$ with $xy\in…

math.CO2021

On the semitotal dominating sets of graphs

Saeid Alikhani, Hassan Zaherifar

A set $D$ of vertices in an isolate-free graph $G$ is a semitotal dominating set of $G$ if $D$ is a dominating set of $G$ and every vertex in $D$ is within distance $2$ from anothe…