H. Golmohammadi

activity

20242026

collaborators

6 papers

math.CO2026

Total outer-independent coalition in graphs

Olga Buntina, Hamidreza Golmohammadi, J. C. Valenzuela-Tripodoro

A set $D$ of vertices graph $G$ is a total outer-independent dominating set (TOIDS) of $G$ if every vertex of $G$ is adjacent to at least one vertex in $D$ , and $V (G) ∖ D$ i…

math.CO2025

On restrained coalitions in graphs: bounds and exact values

Andrey A. Dobrynin, Aleksey N. Glebov, H. Golmohammadi

A subset $D \subseteq V$ is a dominating set of a graph $G$ with vertex set $V$ if every vertex $v \in V ∖ D$ is adjacent to a vertex in $D$ . Two subsets of $V$ form a coal…

math.CO2025

Total restrained coalitions in graphs

M. Chellali, J. C. Valenzuela-Tripodoro, H. Golmohammadi +2

A set $S \subseteq V$ in an isolate-free graph $G$ is a total restrained dominating set, abbreviated TRD-set, if every vertex in $V$ is adjacent to a vertex in $S$ , and every vertex…

math.CO2024

Introduction to double coalitions in graphs

Hamidreza Golmohammadi

Let $G (V, E)$ be a finite, simple, isolate-free graph. A set $D$ of vertices of a graph $G$ with the vertex set $V$ is a double dominating set of $G$ , if every vertex $v \in D$ has…

math.CO2024

Strong coalitions in graphs

Hamidreza Golmohammadi, Saeid Alikhani, Nima Ghanbari +2

For a graph $G = (V, E)$ , a set $D \subset V (G)$ is a strong dominating set of $G$ , if for every vertex $x \in V (G) ∖ D$ there is a vertex $y \in D$ with $x y \in E (G)$ and $deg(x…

math.CO2024

On cubic graphs having the maximal coalition number

Andrey A. Dobrynin, Hamidreza Golmohammadi

A coalition in a graph $G$ with vertex set $V$ consists of two disjoint sets $V_{1}, V_{2} \subset V$ such that neither $V_{1}$ nor $V_{2}$ is a dominating set, but the union $V_{1} \cup V_{2}$ …