Michael A. Henning

activity

20102023

most citedLocating-dominating sets in twin-free graphs

42 citations · 152 across the 58 of their papers we have counts for

collaborators

Showing cs.DMShow all

6 papers · 1 filter

cs.DM2023

Complexity of total dominator coloring in graphs

Michael A. Henning, Kusum, Arti Pandey +1

Let $G = (V, E)$ be a graph with no isolated vertices. A vertex $v$ totally dominate a vertex $w$ ( $w \neq = v$ ), if $v$ is adjacent to $w$ . A set $D \subseteq V$ called a total dominati…

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

Semipaired Domination in Some Subclasses of Chordal Graphs

Michael A. Henning, Arti Pandey, Vikash Tripathi

A dominating set $D$ of a graph $G$ without isolated vertices is called semipaired dominating set if $D$ can be partitioned into $2$ -element subsets such that the vertices in each…

cs.DM2020★ 1 cited

Independent Domination in Subcubic Graphs

A. Akbari, S. Akbari, A. Doosthosseini +3

A set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in $S$ . If, in addition, $S$ is an independent set, then $S$ is an indep…

cs.DM2019

Complexity and Algorithms for Semipaired Domination in Graphs

Michael A. Henning, Arti Pandey, Vikash Tripathi

For a graph $G = (V, E)$ with no isolated vertices, a set $D \subseteq V$ is called a semipaired dominating set of G if $(i)$ $D$ is a dominating set of $G$ , and $(ii)$ $D$ can be part…

cs.DM2017

Algorithmic Aspects of Semitotal Domination in Graphs

Michael A. Henning, Arti Pandey

For a graph $G = (V, E)$ , a set $D \subseteq V$ is called a semitotal dominating set of $G$ if $D$ is a dominating set of $G$ , and every vertex in $D$ is within distance~ $2$ of anothe…