Distance-based vertex identification in graphs: the outer multiset dimension

DOI10.1016/j.amc.2019.124612zbMath1433.05095arXiv1902.03017OpenAlexW2965211119WikidataQ127407465 ScholiaQ127407465MaRDI QIDQ2286139

Rolando Trujillo-Rasua, Yunior Ramírez-Cruz, Reynaldo Gil-Pons, Ismael González Yero

Publication date: 9 January 2020

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.03017

zbMATH Keywords

privacyresolving setmetric dimensionresolvabilitymultiset resolving setouter multiset dimension

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Related Items (3)

Further new results on strong resolving partitions for graphs ⋮ Further contributions on the outer multiset dimension of graphs ⋮ Generalized mapping for multiset rewriting systems

Cites Work

• Resolvability in graphs and the metric dimension of a graph
• \(k\)-metric antidimension: a privacy measure for social graphs
• The multiresolving sets of graphs with prescribed multisimilar equivalence classes
• Landmarks in graphs
• On the metric dimension of some families of graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Distance-based vertex identification in graphs: the outer multiset dimension