Argitalpenak (43) DOROTA KUZIAK argitalpenak

2023

  1. Further Contributions on the Outer Multiset Dimension of Graphs

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

  2. Nonlocal Metric Dimension of Graphs

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

  3. On the (k, ℓ) -anonymity of networks via their k-metric antidimension

    Scientific Reports, Vol. 13, Núm. 1

  4. The Edge Partition Dimension of Graphs

    Discrete Mathematics Letters, Vol. 12, pp. 34-39

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

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

2021

  1. A Constructive Characterization of Vertex Cover Roman Trees

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

  2. A Steiner general position problem in graph theory

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

2019

  1. Outer-independent total Roman domination in graphs

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

  2. Total Roman domination in the lexicographic product of graphs

    Discrete Applied Mathematics, Vol. 263, pp. 88-95

2018

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

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

  2. 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. Mixed metric dimension of graphs

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

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