Dorota Kuziak

activity

20122024

most citedStrong resolving graphs: the realization and the characterization problems

1 citations · 2 across the 8 of their papers we have counts for

collaborators

8 papers

math.CO2024

Coloring the vertices of a graph with mutual-visibility property

Sandi Klavžar, Dorota Kuziak, Juan Carlos Valenzuela Tripodoro +1

Given a graph $G$ , a mutual-visibility coloring of $G$ is introduced as follows. We color two vertices $x, y \in V (G)$ with a same color, if there is a shortest $x, y$ -path whose inte…

math.OC2023

On the (k,l)-anonymity of networks via their $k$ -metric antidimension

Elena Fernández, Dorota Kuziak, Manuel Munoz-Marquez +1

This work focuses on the (k,l)-anonymity of some networks as a measure of their privacy against active attacks. Two different types of networks are considered. The first one consis…

math.CO2022

Further contributions on the outer multiset dimension of graphs

Sandi Klavzar, Dorota Kuziak, Ismael G. Yero

The outer multiset dimension $dim_{ms} (G)$ of a graph $G$ is the cardinality of a smallest set of vertices that uniquely recognize all the vertices outside this set by us…

math.CO2021

Relating the outer-independent total Roman domination number with some classical parameters of graphs

Abel Cabrera Martínez, Dorota Kuziak, Ismael G. Yero

For a given graph $G$ without isolated vertex we consider a function $f : V (G) \to {0, 1, 2}$ . For every $i \in {0, 1, 2}$ , let $V_{i} = {v \in V (G) : f (v) = i}$ . The function $f…

math.CO2016★ 1 cited

Strong resolving graphs: the realization and the characterization problems

D. Kuziak, M. L. Puertas, J. A. Rodriguez-Velazquez +1

The strong resolving graph $G_{S R}$ of a connected graph $G$ was introduced in [Discrete Applied Mathematics 155 (1) (2007) 356--364] as a tool to study the strong metric dimension…

math.CO2016

Mixed metric dimension of graphs

Aleksander Kelenc, Dorota Kuziak, Andrej Taranenko +1

Let $G = (V, E)$ be a connected graph. A vertex $w \in V$ distinguishes two elements (vertices or edges) $x, y \in E \cup V$ if $d_{G} (w, x) \neq = d_{G} (w, y)$ . A set $S$ of vertices in a connecte…