D. Bakhshesh

activity

20172024

most citedIntroduction to total coalitions in graphs

2 citations · 4 across the 8 of their papers we have counts for

collaborators

8 papers

math.CO2024

$k$ -Coalitions in Graphs

Abbas Jafari, Saeid Alikhani, Davood Bakhshesh

In this paper, we propose and investigate the concept of $k$ -coalitions in graphs, where $k \geq 1$ is an integer. A $k$ -coalition refers to a pair of disjoint vertex sets that joint…

math.CO2024

Counting the Number of Domatic Partition of a Graph

Saeid Alikhani, Davood Bakhshesh, Nima Ghanbari

A subset of vertices $S$ of a graph $G$ is a dominating set if every vertex in $V ∖ S$ has at least one neighbor in $S$ . A domatic partition is a partition of the vertices…

math.CO2023

The minmin coalition number in graphs

Davood Bakhshesh, Michael A. Henning

A set $S$ of vertices in a graph $G$ is a dominating set if every vertex of $V (G) ∖ S$ is adjacent to a vertex in $S$ . A coalition in $G$ consists of two disjoint sets of v…

math.CO2023

Singleton Coalition Graph Chains

Davood Bakhshesh, Michael A. Henning, Dinabandhu Pradhan

Let $G$ be graph with vertex set $V$ and order $n = ∣ V ∣$ . A coalition in $G$ is a combination of two distinct sets, $A \subseteq V$ and $B \subseteq V$ , which are disjoint and are not…

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

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…

cs.DM2021

On the coalition number of trees

Davood Bakhshesh, Michael A. Henning, Dinabandhu Pradhan

Let $G$ be a graph with vertex set $V$ and of order $n = ∣ V ∣$ , and let $δ (G)$ and $Δ (G)$ be the minimum and maximum degree of $G$ , respectively. Two disjoint sets $V_1, V_2 \subset…

cs.CC2017★ 2 cited

Complexity results for $k$ -domination and $α$ -domination problems and their variants

Davood Bakhshesh, Mohammad Farshi, Mahdieh Hasheminezhad

Let $G = (V, E)$ be a simple and undirected graph. For some integer $k \geq 1$ , a set $D \subseteq V$ is said to be a k-dominating set in $G$ if every vertex $v$ of $G$ outside $D$ has…

k-Coalitions in Graphs

Counting the Number of Domatic Partition of a Graph

The minmin coalition number in graphs

Singleton Coalition Graph Chains

Connected coalitions in graphs

Introduction to total coalitions in graphs

On the coalition number of trees

Complexity results for k-domination and α-domination problems and their variants

$k$ -Coalitions in Graphs

Complexity results for $k$ -domination and $α$ -domination problems and their variants