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

7 papers

math.CO2022

Adjacent Vertex Distinguishing Total Coloring of Corona Product of Graphs

Hanna Furmańczyk, Rita Zuazua

An adjacent vertex distinguishing total $k$ -coloring $f$ of a graph $G$ is a proper total $k$ -coloring of $G$ such that no pair of adjacent vertices has the same color sets, where…

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…

math.CO2014

Relations between edge removing and edge subdivision concerning domination number of a graph

Magdalena Lemańska, Joaquín Tey, Rita Zuazua

Let $e$ be an edge of a connected simple graph $G$ . The graph obtained by removing (subdividing) an edge $e$ from $G$ is denoted by $G - e$ ( $G_{e}$ ). As usual, $γ (G)$ denotes the domi…

math.CO2013

Total domination multisubdivision number of a graph

Diana Avella-Alaminos, Magda Dettlaff, Magdalena Lemańska +1

The domination multisubdivision number of a nonempty graph $G$ was defined as the minimum positive integer $k$ such that there exists an edge which must be subdivided $k$ times to…

math.CO2013

Graphs with $C_3_-free vertices are not universal fixers

Magdalena Lemańska, Monika Rosicka, Rita Zuazua

A non-isolated vertex $x \in V (G)$ is called $C_{3}$ -free if $x$ belongs to no triangle of $G$ . In \cite{BMW} Burger, Mynhardt and Weakley introduced the idea of universal fixers. L…