D. Bakhshesh

most citedComplexity results for

k

-domination and

α

-domination problems and their variants

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

collaborators

3 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…

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

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