Magdalena Lema'nska

collaborators

3 papers

math.CO2026

Isolation subdivision number of a graph

Magda Dettlaff, Magdalena LemaÅska, Merce Mora +2

For a graph $G = (V, E),$ a set $S \subseteq V$ is called an isolating set of $G$ if the set $V - N [S]$ is independent. The minimum cardinality of an isolating set in $G$ is the isolati…

math.CO2026

Isolation critical graphs under multiple edge subdivision

Karl Bartolo, Peter Borg, Magda Dettlaff +2

This paper introduces the notion of an $(I^^{1}, q)$ -critical graph. The isolation number of a graph $G$ , denoted by $I^^{1} (G)$ and also known as the vertex-edge domination number of $G$ ,…

math.CO2025

Upper bounds on the $k$ -isolation number

Peter Borg, Magdalena LemaÅska, MercÃ¨ Mora +1

The isolation number of a graph $G$ (also called the vertex-edge domination number of $G$ ), denoted by $I^^{1} (G)$ , is the size of a smallest subset $D$ of the vertex set $V (G)$ of $G$ …

Isolation subdivision number of a graph

Isolation critical graphs under multiple edge subdivision

Upper bounds on the k-isolation number

Upper bounds on the $k$ -isolation number