On the [Formula: see text]-anonymity of networks via their k-metric antidimension.

This work focuses on the [Formula: see text]-anonymity of some networks as a measure of their privacy against active attacks. Two different types of networks are considered. The first one consists of graphs with a predetermined structure, namely cylinders, toruses, and 2-dimensional Hamming graphs, whereas the second one is formed by randomly generated graphs.