H. Golmohammadi

activity

20142026

most citedCoalition of cubic graphs of order at most

10

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

collaborators

12 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

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}$ …

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

Independent domination stability in graphs

Saeid Alikhani, Mazharodin Mehraban, Alexei Zakharov +1

A non-empty set $S \subseteq V (G)$ of the simple graph $G = (V (G), E (G))$ is an independent dominating set of $G$ if every vertex not in $S$ is adjacent with some vertex in $S$ and th…

math.CO2023

Connected coalitions in graphs

Saeid Alikhani, Davood Bakhshesh, Hamidreza Golmohammadi +1

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

math.CO2022★ 2 cited

Coalition of cubic graphs of order at most $10$

Saeid Alikhani, Hamid Reza Golmohammadi, Elena V. Konstantinova

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

math.CO2022★ 2 cited

Introduction to total coalitions in graphs

Saeid Alikhani, Davood Bakhshesh, Hamidreza Golmohammadi

Let $G$ be a graph with vertex set $V$ . Two disjoint sets $V_{1}, V_{2} \subseteq V$ are called a total coalition in $G$ , if neither $V_{1}$ and $V_{2}$ is a total dominating set of $G$ but…

math.CO2017★ 1 cited

On the packing numbers in graphs

D. A. Mojdeh, B. Samadi, A. Khodkar +1

In this paper, we find upper bounds on the open packing and $k$ -limited packing numbers with emphasis on the cases $k = 1$ and $k = 2$ . We solve the problem of characterizing all conne…

math.CO2014

$(k, k^{'}, k^{''})$ -domination in graphs

Abdollah Khodkar, Babak Samadi, H. R. Golmohammadi

We first introduce the concept of (k,k',k'')-domination numbers in graphs, which is a generalization of many domination parameters. Then we find lower and upper bounds for this par…

Total outer-independent coalition in graphs

On restrained coalitions in graphs: bounds and exact values

Total restrained coalitions in graphs

Introduction to double coalitions in graphs

On cubic graphs having the maximal coalition number

Strong coalitions in graphs

Independent domination stability in graphs

Connected coalitions in graphs

Coalition of cubic graphs of order at most 10

Introduction to total coalitions in graphs

On the packing numbers in graphs

(k,k′,k′′)-domination in graphs

Coalition of cubic graphs of order at most $10$

$(k, k^{'}, k^{''})$ -domination in graphs