Rita Zuazua
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Rita Zuazua has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Magdalena Lemańska
Gdansk University of Technology
5 shared publications - César Hernández-Cruz
Facultad de Ciencias Universidad Nacional Autónoma de México
1 shared publication - Diana Avella1 shared publication
- Ewa Drgas-Burchardt
University of Zielona Góra
1 shared publication - Gabriel Semanišin
Pavol Jozef Šafárik University in Košice, Faculty of Science
1 shared publication - Hanna Furmańczyk
Institute of Informatics Faculty of Mathematics Physics and Informatics University of Gdańsk Gdańsk Poland
1 shared publication
Latest Publications
- 1 January 2026
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 46 (2) , 569
On covers and domination in trees
- 1 January 2026
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 46 (2) , 569
On covers and domination in trees
- Open Access
Open XOR-magic odd graphs and closed XOR-magic even graphs
XOR-magic graph labelings form a special subclass of group distance magic labelings. A simple connected graph of order $2^n$ is called an open (respectively, closed) XOR-magic graph of power $n$ if its vertices can be labeled bijectively with vectors from $(\mathbb{Z}_2)^n$ such that the sum (over $(\mathbb{Z}_2)^n$) of labels in each open (respectively, closed) neighborhood of every vertex is equal to the zero vector. In one paper, Batal asked whether there exists any odd-regular open XOR-magic graph or any even-regular closed XOR-magic graph. In this paper, with partial help of MILP solver, we answer this question in the affirmative. More precisely, we prove that for every integer $n>3$, there exists an odd-regular open XOR-magic graph of power $n$ and an even-regular closed XOR-magic graph of power $n$. We also show some applications of the spectra of graphs for an open XOR-magic labeling.Open AccessOpen XOR-magic odd graphs and closed XOR-magic even graphs
XOR-magic graph labelings form a special subclass of group distance magic labelings. A simple connected graph of order $2^n$ is called an open (respectively, closed) XOR-magic graph of power $n$ if its vertices can be labeled bijectively with vectors from $(\mathbb{Z}_2)^n$ such that the sum (over $(\mathbb{Z}_2)^n$) of labels in each open (respectively, closed) neighborhood of every vertex is equal to the zero vector. In one paper, Batal asked whether there exists any odd-regular open XOR-magic graph or any even-regular closed XOR-magic graph. In this paper, with partial help of MILP solver, we answer this question in the affirmative. More precisely, we prove that for every integer $n>3$, there exists an odd-regular open XOR-magic graph of power $n$ and an even-regular closed XOR-magic graph of power $n$. We also show some applications of the spectra of graphs for an open XOR-magic labeling. - Open Access
- 21 March 2025
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 25 (2) , #P2.08
Adjacent vertex distinguishing total coloring of corona product of graphs
AMC is a journal published by University of Primorska.
- 21 March 2025
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 25 (2) , #P2.08
Open AccessAdjacent vertex distinguishing total coloring of corona product of graphs
AMC is a journal published by University of Primorska.
- Open Access
- 14 September 2021
- Published by Springer Nature in Results in Mathematics
- Vol. 76 (4) , 1-21
Consecutive Colouring of Oriented Graphs
We consider arc colourings of oriented graphs such that for each vertex the colours of all out-arcs incident with the vertex and the colours of all in-arcs incident with the vertex form intervals. We prove that the existence of such a colouring is an NP-complete problem. We give the solution of the problem for r-regular oriented graphs, transitive tournaments, oriented graphs with small maximum degree, oriented graphs with small order and some other classes of oriented graphs. We state the conjecture that for each graph there exists a consecutive colourable orientation and confirm the conjecture for complete graphs, 2-degenerate graphs, planar graphs with girth at least 8, and bipartite graphs with arboricity at most two that include all planar bipartite graphs. Additionally, we prove that the conjecture is true for all perfect consecutively colourable graphs and for all forbidden graphs for the class of perfect consecutively colourable graphs.
- 14 September 2021
- Published by Springer Nature in Results in Mathematics
- Vol. 76 (4) , 1-21
Open AccessConsecutive Colouring of Oriented Graphs
We consider arc colourings of oriented graphs such that for each vertex the colours of all out-arcs incident with the vertex and the colours of all in-arcs incident with the vertex form intervals. We prove that the existence of such a colouring is an NP-complete problem. We give the solution of the problem for r-regular oriented graphs, transitive tournaments, oriented graphs with small maximum degree, oriented graphs with small order and some other classes of oriented graphs. We state the conjecture that for each graph there exists a consecutive colourable orientation and confirm the conjecture for complete graphs, 2-degenerate graphs, planar graphs with girth at least 8, and bipartite graphs with arboricity at most two that include all planar bipartite graphs. Additionally, we prove that the conjecture is true for all perfect consecutively colourable graphs and for all forbidden graphs for the class of perfect consecutively colourable graphs.
- Open Access
- 5 August 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (16) , 1846
Progress on Roman and Weakly Connected Roman Graphs
A graph G for which is the Roman graph, and if , then G is the weakly connected Roman graph. In this paper, we show that the decision problem of whether a bipartite graph is Roman is a co-NP-hard problem. Next, we prove similar results for weakly connected Roman graphs. We also study Roman trees improving the result of M.A. Henning’s A characterization of Roman trees, Discuss. Math. Graph Theory 22 (2002). Moreover, we give a characterization of weakly connected Roman trees.- 5 August 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (16) , 1846
Open AccessProgress on Roman and Weakly Connected Roman Graphs
A graph G for which is the Roman graph, and if , then G is the weakly connected Roman graph. In this paper, we show that the decision problem of whether a bipartite graph is Roman is a co-NP-hard problem. Next, we prove similar results for weakly connected Roman graphs. We also study Roman trees improving the result of M.A. Henning’s A characterization of Roman trees, Discuss. Math. Graph Theory 22 (2002). Moreover, we give a characterization of weakly connected Roman trees. - Open Access
Equitable total coloring of corona of cubic graphs
The minimum number of total independent partition sets of $V \cup E$ of a graph $G=(V,E)$ is called the \emph{total chromatic number} of $G$, denoted by $\chi''(G)$. If the difference between cardinalities of any two total independent sets is at most one, then the minimum number of total independent partition sets of $V \cup E$ is called the \emph{equitable total chromatic number}, and is denoted by $\chi''_=(G)$. In this paper we consider equitable total coloring of coronas of cubic graphs, $G \circ H$. It turns out that, independly on the values of equitable total chromatic number of factors $G$ and $H$, equitable total chromatic number of corona $G \circ H$ is equal to $\Delta(G \circ H) +1$. Thereby, we confirm Total Coloring Conjecture (TCC), posed by Behzad in 1964, and Equitable Total Coloring Conjecture (ETCC), posed by Wang in 2002, for coronas of cubic graphs. As a direct consequence we get that all coronas of cubic graphs are of Type 1.Open AccessEquitable total coloring of corona of cubic graphs
The minimum number of total independent partition sets of $V \cup E$ of a graph $G=(V,E)$ is called the \emph{total chromatic number} of $G$, denoted by $\chi''(G)$. If the difference between cardinalities of any two total independent sets is at most one, then the minimum number of total independent partition sets of $V \cup E$ is called the \emph{equitable total chromatic number}, and is denoted by $\chi''_=(G)$. In this paper we consider equitable total coloring of coronas of cubic graphs, $G \circ H$. It turns out that, independly on the values of equitable total chromatic number of factors $G$ and $H$, equitable total chromatic number of corona $G \circ H$ is equal to $\Delta(G \circ H) +1$. Thereby, we confirm Total Coloring Conjecture (TCC), posed by Behzad in 1964, and Equitable Total Coloring Conjecture (ETCC), posed by Wang in 2002, for coronas of cubic graphs. As a direct consequence we get that all coronas of cubic graphs are of Type 1. - 26 May 2017
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 33 (4) , 991-998
Total Dominating Sets in Maximal Outerplanar Graphs
- 26 May 2017
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 33 (4) , 991-998
Total Dominating Sets in Maximal Outerplanar Graphs
- Open Access
A characterization of trees having a minimum vertex cover which is also a minimum total dominating set
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 dominating set of $G$ if the subgraph induced by $D$ has no isolated vertices. A $(\gamma_t-\tau)$-set of $G$ is a minimum vertex cover which is also a minimum total dominating set. In this article we give a constructive characterization of trees having a $(\gamma_t-\tau)$-set.Open AccessA characterization of trees having a minimum vertex cover which is also a minimum total dominating set
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 dominating set of $G$ if the subgraph induced by $D$ has no isolated vertices. A $(\gamma_t-\tau)$-set of $G$ is a minimum vertex cover which is also a minimum total dominating set. In this article we give a constructive characterization of trees having a $(\gamma_t-\tau)$-set. - Open Access
On the super domination number of lexicographic product graphs
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 $\overline{D}=V(G)\setminus D$. A set $D\subseteq V(G)$ is called a super dominating set if for every vertex $u\in \overline{D}$, there exists $v\in D$ such that $N(v)\cap \overline{D}=\{u\}$. The super domination number of $G$ is the minimum cardinality among all super dominating sets in $G$. In this article we obtain closed formulas and tight bounds for the super dominating number of lexicographic product graphs in terms of invariants of the factor graphs involved in the product. As a consequence of the study, we show that the problem of finding the super domination number of a graph is NP-Hard.Open AccessOn the super domination number of lexicographic product graphs
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 $\overline{D}=V(G)\setminus D$. A set $D\subseteq V(G)$ is called a super dominating set if for every vertex $u\in \overline{D}$, there exists $v\in D$ such that $N(v)\cap \overline{D}=\{u\}$. The super domination number of $G$ is the minimum cardinality among all super dominating sets in $G$. In this article we obtain closed formulas and tight bounds for the super dominating number of lexicographic product graphs in terms of invariants of the factor graphs involved in the product. As a consequence of the study, we show that the problem of finding the super domination number of a graph is NP-Hard. - Open Access
Relations between edge removing and edge subdivision concerning domination number of a graph
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, $\gamma(G)$ denotes the domination number of $G$. We call $G$ an SR-graph if $\gamma(G-e) = \gamma(G_e)$ for any edge $e$ of $G$, and $G$ is an ASR-graph if $\gamma(G - e) \neq (G_e)$ for any edge $e$ of $G$. In this work we give several examples of SR and ASR-graphs. Also, we characterize SR-trees and show that ASR-graphs are $\gamma$-insensitive.Open AccessRelations between edge removing and edge subdivision concerning domination number of a graph
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, $\gamma(G)$ denotes the domination number of $G$. We call $G$ an SR-graph if $\gamma(G-e) = \gamma(G_e)$ for any edge $e$ of $G$, and $G$ is an ASR-graph if $\gamma(G - e) \neq (G_e)$ for any edge $e$ of $G$. In this work we give several examples of SR and ASR-graphs. Also, we characterize SR-trees and show that ASR-graphs are $\gamma$-insensitive.