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

8 papers · 2 filters

math.CO2014★ 16 cited

Location-domination and matching in cubic graphs

Florent Foucaud, Michael A. Henning

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

math.CO2014★ 42 cited

Locating-dominating sets in twin-free graphs

Florent Foucaud, Michael A. Henning, Christian Löwenstein +1

A locating-dominating set of a graph $G$ is a dominating set $D$ of $G$ with the additional property that every two distinct vertices outside $D$ have distinct neighbors in $D$ ; th…

math.CO2014

Disjunctive Total Domination in Graphs

Michael A. Henning, Viroshan Naicker

Let $G$ be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the total dominatio…

math.CO2014

Graphs with Large Disjunctive Total Domination Number

Michael A. Henning, Viroshan Naicker

Let $G$ be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the total dominatio…

math.CO2014

Trees with Large Neighborhood Total Domination Number

Michael A. Henning, Kirsti Wash

In this paper, we continue the study of neighborhood total domination in graphs first studied by Arumugam and Sivagnanam [Opuscula Math. 31 (2011), 519--531]. A neighborhood total…

math.CO2014

Induced 2-Regular Subgraphs in k-Chordal Cubic Graphs

Michael A. Henning, Felix Joos, Christian Löwenstein +1

We show that a cubic graph $G$ of order $n$ has an induced $2$ -regular subgraph of order at least a) $\frac{n - 2}{4 - \frac{4}{k}}$ , if $G$ has no induced cycle of length more than $k…