activity
20162022
collaborators

11 papers

math.CO2022

Characterization of -excellent -trees

Magda Dettlaff, Michael A. Henning, Jerzy Topp

A graph is -excellent if every vertex of the graph is contained in some maximum independent set of the graph. In this paper, we present two characterizations of the -excellen…

math.CO2021

Minimal graphs with disjoint dominating and total dominating sets

Michael A. Henning, Jerzy Topp

A graph is a DTDP-graph if it has a pair of disjoint sets of vertices of such that is a dominating set and is a total dominating set of . Such graphs wer…

math.CO2021

Graphs with disjoint 2-dominating sets

Michael A. Henning, Jerzy Topp

A subset is a dominating set of if every vertex in has a neighbor in , while is a 2-dominating set of if every vertex belonging to…

math.CO2019

Minimal graphs with disjoint dominating and paired-dominating sets

Michael A. Henning, Jerzy Topp

A subset is a dominating set of if every vertex in has a~neighbor in , while is a paired-dominating set of if is a~dominating set and th…

math.CO2019

Disjoint dominating and 2-dominating sets in graphs

Mateusz Miotk, Jerzy Topp, Paweł Żyliński

A graph is a -graph if it has a pair of disjoint sets of vertices of such that is a dominating set and is a 2-dominating set of . We provide…

math.CO2019

Bipartization of graphs

Mateusz Miotk, Jerzy Topp, Paweł Żyliński

A dominating set of a graph is a set such that every vertex in is adjacent to at least one vertex in , and the domination number of is th…