Iman Masoumi

activity

20202025

most citedRestrained Italian domination in graphs

15 citations · 15 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2025

Edge Coalitions in Graphs

Nazli Besharati, Azam Sadat Emadi, Iman Masoumi

Coalition concepts have been extensively studied in domination theory for vertex sets, whereas their edge counterparts have remained largely unexplored. Motivated by this, we intro…

math.CO2024

Further Results on the Majority Roman Domination in graphs

Azam Sadat Emadi, Iman Masoumi, Seyed Reza Musawi

Let $G = (V, E)$ be a simple graph of order $n$ . A Majority Roman Dominating Function (MRDF) on a graph G is a function $f : V \to {- 1, + 1, 2}$ if the sum of its function value…

math.CO2023

Edge coalitions in graphs

Nazli Besharati, Azam Sadat Emadi, Iman Masoumi

An edge coalition in a graph $G = (V, E)$ consists of two disjoint sets of edges $E_{1}$ and $E_{2}$ , neither of which is an edge dominating set but whose union $E_{1} \cup E_{2}$ is an edge d…

math.CO2021

Restrained double Roman domination of a graph

Doost Ali Mojdeh, Iman Masoumi, Lutz Volkmann

For a graph G=(V,E), a restrained double Roman dominating function is a function f:V\rightarrow\{0,1,2,3\} having the property that if f(v)=0, then the vertex v must have at least…

math.CO2020★ 15 cited

Restrained Italian domination in graphs

Babak Samadi, Morteza Alishahi, Iman Masoumi +1

For a graph $G = (V (G), E (G))$ , an Italian dominating function (ID function) $f : V (G) \to {0, 1, 2}$ has the property that for every vertex $v \in V (G)$ with $f (v) = 0$ , either $v$ …