A. Emadi

activity

20192025

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.CO2022

Majority dominator colorings of graphs

Marcin Anholcer, Azam Sadat Emadi, Doost Ali Mojdeh

Let $G$ be a simple graph of order $n$ . A majority dominator coloring of a graph $G$ is proper coloring in which each vertex of the graph dominates at least half of one color class…

math.CO2019

Total vertex product irregularity strength of graphs

Marcin Anholcer, Azam Sadat Emadi, Doost Ali Mojdeh

Consider a simple graph $G$ . We call a labeling $w : E (G) \cup V (G) \to {1, 2, \dots, s}$ (\textit{total vertex}) \textit{product-irregular}, if all product degrees $p d_{G} (v)$ …