H. Ahangar

most citedTotal Roman {2}-Dominating functions in Graphs

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

collaborators

3 papers

math.CO2024★ 20 cited

Total Roman {2}-Dominating functions in Graphs

H. Abdollahzadeh Ahangar, M. Chellali, S. M. Sheikholeslami +1

A Roman ${2}$ -dominating function (R2F) is a function $f : V \to {0, 1, 2}$ with the property that for every vertex $v \in V$ with $f (v) = 0$ there is a neighbor $u$ of $v$ wit…

math.CO2024★ 17 cited

Maximal double Roman domination in graphs

H. Abdollahzadeh Ahangar, M. Chellali, S. M. Sheikholeslami +1

A maximal double Roman dominating function (MDRDF) on a graph $G = (V, E)$ is a function $f : V (G) \to {0, 1, 2, 3}$ such that \textrm{(i) }every vertex $v$ with $f (v) = 0$ is adjac…

math.CO2021★ 5 cited

Restrained condition on double Roman dominating functions

Babak Samadi, Nasrin Soltankhah, H. Abdollahzadeh Ahangar +4

We continue the study of restrained double Roman domination in graphs. For a graph $G=\big{(}V(G),E(G)\big{)}$, a double Roman dominating function $f$ is called a restrained double…