M. Dettlaff

most citedOn the super domination number of lexicographic product graphs

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

collaborators

4 papers

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★ 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

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.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,…