Maria Antonia Mateos-Camacho
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Maria Antonia Mateos-Camacho has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Juan Carlos Valenzuela-Tripodoro
Departamento de Matemáticas, Universidad de Cádiz, 11202 Algeciras, Spain
5 shared publications - Martin Cera
Departamento de Matemática Aplicada I, Universidad de Sevilla ETS de Ingeniería informática, Avda. Reina Mercedes, s/n, 41012 Sevilla, Spain
5 shared publications - Maria Pilar Alvarez-Ruiz
Departamento de Estadística e IO, Universidad de Cádiz, 11202 Algeciras, Spain
4 shared publications M. P. Alvarez-Ruiz
University of Cadiz
1 shared publication
Latest Publications
- Open Access
- 1 May 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (9) , 1535
Complexity and Exact Values for [k]-Roman and Strong Roman Domination for Specific Graph Families
Motivated by the original idea of defending the Roman Empire, all these domination concepts can be interpreted as vertex-labeling schemes that model the allocation of resources to protect a graph against attacks. A Roman dominating function (RDF) is a labeling of the vertices of a graph with labels in such that every vertex labeled 0 is adjacent to at least one vertex labeled 2. The weight of an RDF is the sum of all vertex labels. Vertices labeled 2 are intended to protect their neighbors labeled 0. The Roman domination number is the minimum weight of an RDF on the graph. In 2017, Álvarez et al. introduced strong Roman domination as a variant of Roman domination designed to protect the vertices of a graph against multiple simultaneous attacks. In 2021, Ahangar et al. defined -Roman domination, another model intended to defend a graph against individual attacks on vertices. In this paper, we investigate the computational complexity of the associated decision problems for -Roman domination and strong Roman domination. Furthermore, we determine exact values of these parameters for several graph families under both variants.- 1 May 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (9) , 1535
Open AccessComplexity and Exact Values for [k]-Roman and Strong Roman Domination for Specific Graph Families
Motivated by the original idea of defending the Roman Empire, all these domination concepts can be interpreted as vertex-labeling schemes that model the allocation of resources to protect a graph against attacks. A Roman dominating function (RDF) is a labeling of the vertices of a graph with labels in such that every vertex labeled 0 is adjacent to at least one vertex labeled 2. The weight of an RDF is the sum of all vertex labels. Vertices labeled 2 are intended to protect their neighbors labeled 0. The Roman domination number is the minimum weight of an RDF on the graph. In 2017, Álvarez et al. introduced strong Roman domination as a variant of Roman domination designed to protect the vertices of a graph against multiple simultaneous attacks. In 2021, Ahangar et al. defined -Roman domination, another model intended to defend a graph against individual attacks on vertices. In this paper, we investigate the computational complexity of the associated decision problems for -Roman domination and strong Roman domination. Furthermore, we determine exact values of these parameters for several graph families under both variants. - Open Access
- 12 April 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (8) , 1277
On the Total Version of Triple Roman Domination in Graphs
In this paper, we describe the study of total triple Roman domination. Total triple Roman domination is an assignment of labels from to the vertices of a graph such that every vertex is protected by at least three units either on itself or its neighbors while ensuring that none of its neighbors remains unprotected. Formally, a total triple Roman dominating function is a function such that , where denotes the set of active neighbors of vertex v, i.e., those assigned a positive label. We investigate the algorithmic complexity of the associated decision problem, establish sharp bounds regarding graph structural parameters, and obtain the exact values for several graph families.- 12 April 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (8) , 1277
Open AccessOn the Total Version of Triple Roman Domination in Graphs
In this paper, we describe the study of total triple Roman domination. Total triple Roman domination is an assignment of labels from to the vertices of a graph such that every vertex is protected by at least three units either on itself or its neighbors while ensuring that none of its neighbors remains unprotected. Formally, a total triple Roman dominating function is a function such that , where denotes the set of active neighbors of vertex v, i.e., those assigned a positive label. We investigate the algorithmic complexity of the associated decision problem, establish sharp bounds regarding graph structural parameters, and obtain the exact values for several graph families. - Open Access
- 17 March 2025
- Published by MDPI AG in Preprints.org
On The Total Version Of Triple Roman Domination In Graphs
In this paper, we initiate the study of total triple Roman domination, in which we aim to ensure that each vertex of the graph is protected by at least three units, either located on itself or its neighbors, while guaranteeing that none of its neighbors remain unprotected. Formally, a total triple Roman dominating function is a labeling f of the vertices of the graph with labels {0,1,…,4} such that f(N[v])≥|AN(v)|+3, where AN(v) denotes the set of active neighbors of vertex v, i.e., those assigned a positive label. We investigate the algorithmic complexity of the associated decision problem, establish sharp bounds regarding graph structural parameters, and obtain the exact values for several graph families.
- 17 March 2025
- Published by MDPI AG in Preprints.org
Open AccessOn The Total Version Of Triple Roman Domination In Graphs
In this paper, we initiate the study of total triple Roman domination, in which we aim to ensure that each vertex of the graph is protected by at least three units, either located on itself or its neighbors, while guaranteeing that none of its neighbors remain unprotected. Formally, a total triple Roman dominating function is a labeling f of the vertices of the graph with labels {0,1,…,4} such that f(N[v])≥|AN(v)|+3, where AN(v) denotes the set of active neighbors of vertex v, i.e., those assigned a positive label. We investigate the algorithmic complexity of the associated decision problem, establish sharp bounds regarding graph structural parameters, and obtain the exact values for several graph families.
- Open Access
- 27 March 2024
- Published by Springer Nature in Bulletin of the Iranian Mathematical Society
- Vol. 50 (2) , 1-16
Further Results on the [k]-Roman Domination in Graphs
In 2016, Beeler et al. defined the double Roman domination as a variation of Roman domination. Sometime later, in 2021, Ahangar et al. introduced the concept of [k]-Roman domination in graphs and settled some results on the triple Roman domination case. In 2022, Amjadi et al. studied the quadruple version of this Roman-domination-type problem. Given any labeling of the vertices of a graph, AN(v) stands for the set of neighbors of a vertex v having a positive label. In this paper we continue the study of the [k]-Roman domination functions ([k]-RDF) in graphs which coincides with the previous versions when $$2\le k \le 4$$ . Namely, f is a [k]-RDF if $$f(N[v])\ge k+|AN(v)|$$ for all v. We prove that the associate decision problem is NP-complete even when restricted to star convex and comb convex bipartite graphs and we also give sharp bounds and exact values for several classes of graphs.- 27 March 2024
- Published by Springer Nature in Bulletin of the Iranian Mathematical Society
- Vol. 50 (2) , 1-16
Open AccessFurther Results on the [k]-Roman Domination in Graphs
In 2016, Beeler et al. defined the double Roman domination as a variation of Roman domination. Sometime later, in 2021, Ahangar et al. introduced the concept of [k]-Roman domination in graphs and settled some results on the triple Roman domination case. In 2022, Amjadi et al. studied the quadruple version of this Roman-domination-type problem. Given any labeling of the vertices of a graph, AN(v) stands for the set of neighbors of a vertex v having a positive label. In this paper we continue the study of the [k]-Roman domination functions ([k]-RDF) in graphs which coincides with the previous versions when $$2\le k \le 4$$ . Namely, f is a [k]-RDF if $$f(N[v])\ge k+|AN(v)|$$ for all v. We prove that the associate decision problem is NP-complete even when restricted to star convex and comb convex bipartite graphs and we also give sharp bounds and exact values for several classes of graphs. - Open Access
- 12 May 2023
- Published by Springer Nature in Research Square
The [k]-multiple Roman domination in Graphs
In 2016, Beeler et al. introduced the double Roman domination as a variation of Roman domination and recently Abdollahzadeh et al. (resp. Amjadi et al.) initiated the study of triple (resp. quadruple) Roman domination in graphs. Given any labeling of the vertices of a graph, AN(v) stands for the set of neighbors of a vertex v having a positive label. In this paper we generalize these concepts by studying the [k]-multiple Roman domination functions ([k]-MRDF) in graphs which coincides with the previous versions when 2 ≤ k ≤ 4. Namely, f is a [k]-MRDF if f(N[v]) ≥ k + |AN(v)| for all v. We approach the complexity of the associate decision problem and we also give sharp bounds and exact values for several classes of graphs.
- 12 May 2023
- Published by Springer Nature in Research Square
Open AccessThe [k]-multiple Roman domination in Graphs
In 2016, Beeler et al. introduced the double Roman domination as a variation of Roman domination and recently Abdollahzadeh et al. (resp. Amjadi et al.) initiated the study of triple (resp. quadruple) Roman domination in graphs. Given any labeling of the vertices of a graph, AN(v) stands for the set of neighbors of a vertex v having a positive label. In this paper we generalize these concepts by studying the [k]-multiple Roman domination functions ([k]-MRDF) in graphs which coincides with the previous versions when 2 ≤ k ≤ 4. Namely, f is a [k]-MRDF if f(N[v]) ≥ k + |AN(v)| for all v. We approach the complexity of the associate decision problem and we also give sharp bounds and exact values for several classes of graphs.