M. Lemańska

activity

20162020

most citedOn the super domination number of lexicographic product graphs

1 citations · 1 across the 2 of their papers we have counts for

collaborators

3 papers

math.CO2020

Critical graphs upon multiple edge subdivision

Magda Dettlaff, Magdalena Lemanska, Adriana Roux

A subset $D$ of $V$ is \emph{dominating} in $G$ if every vertex of $V - D$ has at least one neighbour in $D;$ let $γ (G)$ be the minimum cardinality among all dominating sets in $G .$ …

math.CO2017★ 1 cited

On the super domination number of lexicographic product graphs

M. Dettlaff, M. Lemańska, J. A. Rodríguez-Velázquez +1

The neighbourhood of a vertex $v$ of a graph $G$ is the set $N (v)$ of all vertices adjacent to $v$ in $G$ . For $D \subseteq V (G)$ we define $D = V (G) ∖ D$ . A set $D\…

math.CO2016

Coronas and domination subdivision number of a graph

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

In this paper, for a graph G and a family of partitions P of vertex neighborhoods of G, we define the general corona G \circ P of G. Among several properties of this new operation,…