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 2019 · math.COShow all

5 papers · 2 filters

math.CO2019

Minimal graphs with disjoint dominating and paired-dominating sets

Michael A. Henning, Jerzy Topp

A subset $D \subseteq V_{G}$ is a dominating set of $G$ if every vertex in $V_{G} - D$ has a~neighbor in $D$ , while $D$ is a paired-dominating set of $G$ if $D$ is a~dominating set and th…

math.CO2019

Domination versus edge domination

Julien Baste, Maximilian Fürst, Michael A. Henning +2

We propose the conjecture that the domination number $γ (G)$ of a $Δ$ -regular graph $G$ with $Δ \geq 1$ is always at most its edge domination number $γ_{e} (G)$ , which coincides with th…

math.CO2019

Traceability of Connected Domination Critical Graphs

Michael A. Henning, Nawarat Ananchuen, Pawaton Kaemawichanurat

A dominating set in a graph $G$ is a set $S$ of vertices of $G$ such that every vertex outside $S$ is adjacent to a vertex in $S$ . A connected dominating set in $G$ is a dominating…

math.CO2019

Bounding and approximating minimum maximal matchings in regular graphs

Julien Baste, Maximilian Fürst, Michael A. Henning +2

The edge domination number $γ_{e} (G)$ of a graph $G$ is the minimum size of a maximal matching in $G$ . It is well known that this parameter is computationally very hard, and several…

math.CO2019

Maker-Breaker total domination game

Valentin Gledel, Michael A. Henning, Vesna Iršič +1

Maker-Breaker total domination game in graphs is introduced as a natural counterpart to the Maker-Breaker domination game recently studied by Duchêne, Gledel, Parreau, and Renault.…