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 2021Show all

5 papers · 1 filter

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…

math.CO2021

Compelling Colorings: A generalization of the dominator chromatic number

Anna Bachstein, Wayne Goddard, Michael A. Henning +1

We define a $P$ -compelling coloring as a proper coloring of the vertices of a graph such that every subset consisting of one vertex of each color has property $P$ . The $P$ -compelli…

math.CO2021

Conjecture of TxGraffiti: Independence, domination, and matchings

Yair Caro, Randy Davila, Michael Henning +1

TxGraffiti is an automated conjecturing program that produces graph theoretic conjectures in the form of conjectured inequalities. This program written and maintained by the second…

math.CO2021

Minimal graphs with disjoint dominating and total dominating sets

Michael A. Henning, Jerzy Topp

A graph $G$ is a DTDP-graph if it has a pair $(D, T)$ of disjoint sets of vertices of $G$ such that $D$ is a dominating set and $T$ is a total dominating set of $G$ . Such graphs wer…

math.CO2021★ 1 cited

Graphs with disjoint 2-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 2-dominating set of $G$ if every vertex belonging to…