3 papers
math.CO2019
On the connected and weakly convex domination numbers
Magda Dettlaff, Magdalena Lemańska, Dorota Osula +1
In this paper we study relations between connected and weakly convex domination numbers. We show that in general the difference between these numbers can be arbitrarily large and w…
math.CO2017
Graphs with equal domination and certified domination numbers
Magda Dettlaff, Magdalena Lemańska, Mateusz Miotk +3
A set of vertices of a graph is a dominating set of if every vertex in is adjacent to at least one vertex in . The domination number (upper domination number…
math.CO2016
Certified domination
Magda Dettlaff, Magdalena Lemańska, Jerzy Topp +2
Imagine that we are given a set of officials and a set of civils. For each civil , there must be an official that can serve , and whenever any such $v…