M. Samadzadeh

activity

20232025

collaborators

4 papers

math.CO2025

Global coalitions in graphs

Nazli Besharati, Doost Ali Mojdeh, Mohammad Reza Samadzadeh +1

Let $G = (V, E)$ be a graph. A subset $S \subseteq V$ is called a global dominating set of $G$ if it is a dominating set of both $G$ and its complement $G$ . Two disjoint s…

math.CO2024

Perfect coalition in graphs

Doost Ali Mojdeh, Mohammad Reza Samadzadeh

\noindent A perfect dominating set in a graph $G = (V, E)$ is a subset $S \subseteq V$ such that each vertex in $V ∖ S$ has exactly one neighbor in $S$ . A perfect coalition in…

math.CO2024

Paired coalition in graphs

Mohammad Reza Samadzadeh, Doost Ali Mojdeh, Reza Nadimi

\noindent A paired coalition in a graph $G = (V, E)$ consists of two disjoint sets of vertices $V_{1}$ and $V_{2}$ , neither of which is a paired dominating set but whose union $V_1 \cup V…

math.CO2023

Independent coalition in graphs: existence and characterization

Mohammad Reza Samadzadeh, Doost Ali Mojdeh

An independent coalition in a graph $G$ consists of two disjoint sets of vertices $V_{1}$ and $V_{2}$ neither of which is an independent dominating set but whose union $V_{1} \cup V_{2}$ i…