5 papers
Multiset resolvability parameters in graphs: A survey with new results and open problems
Mohammad Farhan, Sandi Klavžar, Dorota Kuziak +1
The metric dimension, which has lots of variants and numerous applications in other fields, is one of the most important and most extensively studied topics in metric graph theory.…
The weak -metric dimension of the direct product of complete graphs
Mohammad Farhan, Dorota Kuziak, Ismael G. Yero
The weak -metric dimension of a graph is roughly understood as the cardinality of a smallest set of vertices of the graph with the property of uniquely recognizing all the v…
Moving through Cartesian products, coronas and joins in general position
Sandi Klavžar, Aditi Krishnakumar, Dorota Kuziak +3
The general position problem asks for large sets of vertices such that no three vertices of the set lie on a common shortest path. Recently a dynamic version of this problem was de…
On the -multiset anonymity measure for social graphs
Alejandro Estrada-Moreno, Elena Fernández, Dorota Kuziak +3
The publication of social graphs must be preceded by a rigorous analysis of privacy threats against social graph users. When the threat comes from inside the social network itself,…
On the weak -metric dimension of Hamming graphs
Elena Fernandez, Sandi Klavzar, Dorota Kuziak +2
Given a connected graph , a set of vertices is a weak -resolving set of if for each two vertices , the sum of the values $|d_G(y,x)-d_G(z,x)|…