Publicaciones en colaboración con investigadores/as de Universitat Rovira i Virgili (61)

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

  2. Independent Transversal Total Domination Versus Total Domination in Trees

    Discussiones Mathematicae - Graph Theory, Vol. 41, Núm. 1, pp. 213-224

  3. On the (k,t)-Metric Dimension of Graphs

    Computer Journal, Vol. 64, Núm. 5, pp. 707-720

  4. Roman domination in direct product graphs and rooted product graphs

    AIMS Mathematics, Vol. 6, Núm. 10, pp. 11084-11096

  5. Total Roman {2}-domination in graphs

    Quaestiones Mathematicae, Vol. 44, Núm. 3, pp. 411-434

2020

  1. Constructive characterizations concerning weak Roman domination in trees

    Discrete Applied Mathematics, Vol. 284, pp. 384-390

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

    Mathematics, Vol. 8, Núm. 9

2019

  1. A characterization of trees with equal Roman {2}-domination and Roman domination numbers

    Communications in Combinatorics and Optimization, Vol. 4, Núm. 2, pp. 95-107

  2. Outer-independent total Roman domination in graphs

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

  3. Quasi-total Roman Domination in Graphs

    Results in Mathematics, Vol. 74, Núm. 4

2018

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

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

2017

  1. A survey on alliances in graphs: Defensive alliances

    Utilitas Mathematica, Vol. 105, pp. 141-172

  2. Computing the k-metric dimension of graphs

    Applied Mathematics and Computation, Vol. 300, pp. 60-69

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

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

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

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

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