Publications (23) DOROTA KUZIAK publications

filter_list Discrete Mathematics and Combinatorics

2023

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

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

  2. The Edge Partition Dimension of Graphs

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

  3. 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 Steiner general position problem in graph theory

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

2020

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

    Mathematics, Vol. 8, Núm. 9

  2. Further new results on strong resolving partitions for graphs

    Open Mathematics, Vol. 18, Núm. 1, pp. 237-248

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

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. Domination-Related Parameters in Rooted Product Graphs

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

  2. Maximal 2-rainbow domination number of a graph

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

  3. On maximal Roman domination in graphs

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

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

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

  5. Strong metric dimension of rooted product graphs

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

  6. The partition dimension of corona product graphs

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

  7. The security number of strong grid-like graphs

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

2015

  1. On the strong metric dimension of Cartesian sum graphs

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

  2. On the strong metric dimension of the strong products of graphs

    Open Mathematics, Vol. 13, Núm. 1, pp. 64-74