R. Zuazua

activity

20132022

most citedOn the super domination number of lexicographic product graphs

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

collaborators

Showing 2017Show all

3 papers · 1 filter

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.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.CO2017

Twin domination number of Tournaments

Dorota Osula, Rita Zuazua

Let $D = (V, A)$ be a digraph. A subset $S$ of $V$ is called a twin dominating set of $D$ if for every vertex $v \in V - S$ , there exists vertices $u_{1}, u_{2} \in S$ such that $(v, u_{1})$ and…