149 citations · 707 across the 83 of their papers we have counts for
6 papers · 1 filter
Equidistant dimension of Cartesian product graphs
Adria Gispert-Fernandez, Juan A. Rodriguez-Velazquez, Ismael G. Yero
Given a connected graph , the equidistant dimension of represents the cardinality of the smallest set of vertices of such that for any two vertices the…
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)|…
Independent mutual-visibility coloring and related concepts
Boštjan Brešar, Iztok Peterin, Babak Samadi +1
Given a graph , a subset is a mutual-visibility (MV) set if for every , there exists a -geodesic whose internal vertices are not in . We inve…
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…
Burning some myths on privacy properties of social networks against active attacks
Serafino Cicerone, Gabriele Di Stefano, Sandi Klavžar +1
This work focuses on showing some arguments addressed to dismantle the extended idea about that social networks completely lacks of privacy properties. We consider the so-called ac…