Michael A. Henning

activity

20142017

most citedTotal Forcing Sets in Trees

3 citations · 5 across the 7 of their papers we have counts for

collaborators

7 papers

math.CO2017★ 3 cited

Total Forcing Sets in Trees

Randy Davila, Michael Henning

A dynamic coloring of the vertices of a graph $G$ starts with an initial subset $S$ of colored vertices, with all remaining vertices being non-colored. At each discrete time interv…

math.CO2015

Matchings and Path Covers with applications to Domination in Graphs

Michael A. Henning, Kirsti Wash

Let $G$ be a graph with no isolated vertex. A matching in $G$ is a set of edges that are pairwise not adjacent in $G$ , while the matching number, $α^{'} (G)$ , of $G$ is the maximum siz…

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…