2 papers
math.CO2024
Upper bounds on the -isolation number
Peter Borg, Magdalena Lemańska, Mercè Mora +1
The isolation number of a graph (also called the vertex-edge domination number of ), denoted by , is the size of a smallest subset of the vertex set of …
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…