M. Dettlaff

activity

20122026

most citedBondage number of grid graphs

9 citations · 14 across the 14 of their papers we have counts for

collaborators

Showing 2017Show all

2 papers · 1 filter

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\…