Metric dimension related parameters in graphs: A survey on combinatorial, computational and applied results

Abstract

Topics concerning metric dimension related invariants in graphs are nowadays intensively studied. This compendium of combinatorial and computational results on this topic is an attempt of surveying those contributions that are of the highest interest for the research community dealing with several variants of metric dimension in graphs.

arXiv comment64 pages

References in corpus (20)

• On the Metric Dimension of Cartesian Products of Graphs
• On the strong metric dimension of corona product graphs and join graphs
• A note on the partition dimension of Cartesian product graphs
• On the partition dimension of trees
• The Simultaneous Metric Dimension of Graph Families
• On the partition dimension of unicyclic graphs
• Rethinking $(k,\ell )$-anonymity in social graphs: $(k,\ell )$-adjacency anonymity and $(k,\ell )$-(adjacency) anonymous transformations
• Distance-based vertex identification in graphs: the outer multiset dimension
• On analyzing and evaluating privacy measures for social networks under active attack
• The multiset dimension of graphs
• On optimal approximability results for computing the strong metric dimension
• Minimum Fault-Tolerant, local and strong metric dimension of graphs
• On the strong metric dimension of Cartesian sum graphs
• The strong metric dimension of some generalized Petersen graphs
• The Fractional Local Metric Dimension of Graphs
• On the Partition Dimension and the Twin Number of a Graph
• Lexicographic metric spaces: basic properties and the metric dimension
• Metric dimension for random graphs
• Some new general lower bounds for mixed metric dimension of graphs
• Some binary products and integer linear programming for computing $k$-metric dimension of graphs