M. Samadzadeh

collaborators

2 papers

math.CO2025

Global coalition sets 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 serves as a dominating set in both $G$ and its complement $G$ . We defi…

math.CO2025

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…