Publicaciones en colaboración con investigadores/as de Institute of Mathematics, Physics, and Mechanics (23)

2024

  1. Lower (total) mutual-visibility number in graphs

    Applied Mathematics and Computation, Vol. 465

  2. Resolvability and Convexity Properties in the Sierpiński Product of Graphs

    Mediterranean Journal of Mathematics, Vol. 21, Núm. 1

2023

  1. Further Contributions on the Outer Multiset Dimension of Graphs

    Results in Mathematics, Vol. 78, Núm. 2

  2. Injective coloring of graphs revisited

    Discrete Mathematics, Vol. 346, Núm. 5

  3. On metric dimensions of hypercubes

    Ars Mathematica Contemporanea, Vol. 23, Núm. 2

  4. On mixed metric dimension in subdivision, middle, and total graphs

    Quaestiones Mathematicae, Vol. 46, Núm. 12, pp. 2517-2527

  5. Variety of mutual-visibility problems in graphs

    Theoretical Computer Science, Vol. 974

2022

  1. Incidence dimension and 2-packing number in graphs

    RAIRO - Operations Research, Vol. 56, Núm. 1, pp. 199-211

2021

  1. A Steiner general position problem in graph theory

    Computational and Applied Mathematics, Vol. 40, Núm. 6

  2. General d-position sets

    Ars Mathematica Contemporanea, Vol. 21, Núm. 1

  3. Maker–Breaker Resolving Game

    Bulletin of the Malaysian Mathematical Sciences Society, Vol. 44, Núm. 4, pp. 2081-2099

  4. On General Position Sets in Cartesian Products

    Results in Mathematics, Vol. 76, Núm. 3

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

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

2020

  1. (Open) packing number of some graph Products

    Discrete Mathematics and Theoretical Computer Science, Vol. 22, Núm. 4

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

    Mathematics, Vol. 8, Núm. 9

  3. Edge Metric Dimension of Some Graph Operations

    Bulletin of the Malaysian Mathematical Sciences Society, Vol. 43, Núm. 3, pp. 2465-2477

2019

  1. The general position problem and strong resolving graphs

    Open Mathematics, Vol. 17, Núm. 1, pp. 1126-1135

2018

  1. Bounding the open k-monopoly number of strong product graphs

    Discussiones Mathematicae - Graph Theory, Vol. 38, Núm. 1, pp. 287-299

2017

  1. Graphs that are simultaneously efficient open domination and efficient closed domination graphs

    Discrete Applied Mathematics, Vol. 217, pp. 613-621

  2. Mixed metric dimension of graphs

    Applied Mathematics and Computation, Vol. 314, pp. 429-438