D. Bakhshesh

activity

20172024

k

-domination and

α

-domination problems and their variants

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

collaborators

Showing math.COShow all

4 papers · 1 filter

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…

k-Coalitions in Graphs

Counting the Number of Domatic Partition of a Graph

The minmin coalition number in graphs

Singleton Coalition Graph Chains

$k$ -Coalitions in Graphs