Publications in collaboration with researchers from Universitat Rovira i Virgili (29)

2023

  1. Total Mutual-Visibility in Graphs with Emphasis on Lexicographic and Cartesian Products

    Bulletin of the Malaysian Mathematical Sciences Society, Vol. 46, Núm. 6

2022

  1. Relating the Outer-Independent Total Roman Domination Number with Some Classical Parameters of Graphs

    Mediterranean Journal of Mathematics, Vol. 19, Núm. 3

2021

  1. A Constructive Characterization of Vertex Cover Roman Trees

    Discussiones Mathematicae - Graph Theory, Vol. 41, Núm. 1, pp. 267-283

2020

  1. Dominating the direct product of two graphs through total Roman strategies

    Mathematics, Vol. 8, Núm. 9

2019

  1. Outer-independent total Roman domination in graphs

    Discrete Applied Mathematics, Vol. 269, pp. 107-119

2018

  1. Strong resolving graphs: The realization and the characterization problems

    Discrete Applied Mathematics, Vol. 236, pp. 270-287

2017

  1. Computing the metric dimension of a graph from primary subgraphs

    Discussiones Mathematicae - Graph Theory, Vol. 37, Núm. 1, pp. 273-293

  2. Resolvability and Strong Resolvability in the Direct Product of Graphs

    Results in Mathematics, Vol. 71, Núm. 1-2, pp. 509-526

2016

  1. Closed formulae for the strong metric dimension of lexicographic product graphs

    Discussiones Mathematicae - Graph Theory, Vol. 36, Núm. 4, pp. 1051-1064

  2. Domination-Related Parameters in Rooted Product Graphs

    Bulletin of the Malaysian Mathematical Sciences Society, Vol. 39, Núm. 1, pp. 199-217

  3. Maximal 2-rainbow domination number of a graph

    AKCE International Journal of Graphs and Combinatorics, Vol. 13, Núm. 2, pp. 157-164

  4. On maximal Roman domination in graphs

    International Journal of Computer Mathematics, Vol. 93, Núm. 7, pp. 1093-1102

  5. On the monopolies of lexicographic product graphs: Bounds and closed formulas

    Bulletin Mathematique de la Societe des Sciences Mathematiques de Roumanie, Vol. 59, Núm. 4, pp. 355-366

  6. Open k-monopolies in graphs: complexity and related concepts

    Discrete Mathematics and Theoretical Computer Science, Vol. 18, Núm. 3

  7. Strong metric dimension of rooted product graphs

    International Journal of Computer Mathematics, Vol. 93, Núm. 8, pp. 1265-1280

  8. The partition dimension of corona product graphs

    Ars Combinatoria, Vol. 127, pp. 387-399

  9. The security number of strong grid-like graphs

    Theoretical Computer Science, Vol. 653, pp. 1-14

2015

  1. Computing the (k-)monopoly number of direct product of graphs

    Filomat, Vol. 29, Núm. 5, pp. 1163-1171

  2. Erratum: On the strong metric dimension of the strong products of graphs (Open Mathematics (2015) 13 (64-74))

    Open Mathematics

  3. On the strong metric dimension of Cartesian sum graphs

    Fundamenta Informaticae, Vol. 141, Núm. 1, pp. 57-69