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

Showing 2023Show all

3 papers · 1 filter

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…