Magda Lema'nska

activity

20132019

collaborators

5 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 $D$ of vertices of a graph $G$ is a dominating set of $G$ if every vertex in $V_{G} - D$ is adjacent to at least one vertex in $D$ . The domination number (upper domination number…

math.CO2017

A characterization of trees having a minimum vertex cover which is also a minimum total dominating set

César Hernández-Cruz, Magdalena Lemańska, Rita Zuazua

A vertex cover of a graph $G = (V, E)$ is a set $X \subseteq V$ such that each edge of $G$ is incident to at least one vertex of $X$ . A dominating set $D \subseteq V$ is a total do…

math.CO2016

Certified domination

Magda Dettlaff, Magdalena Lemańska, Jerzy Topp +2

Imagine that we are given a set $D$ of officials and a set $W$ of civils. For each civil $x \in W$ , there must be an official $v \in D$ that can serve $x$ , and whenever any such $v…

math.CO2013

Graphs with $C_3_-free vertices are not universal fixers

Magdalena Lemańska, Monika Rosicka, Rita Zuazua

A non-isolated vertex $x \in V (G)$ is called $C_{3}$ -free if $x$ belongs to no triangle of $G$ . In \cite{BMW} Burger, Mynhardt and Weakley introduced the idea of universal fixers. L…