Resolving vertices of graphs with differences
Iztok Peterina, Jelena Sedlar, Riste \v{S}krekovski, Ismael G. Yero

TL;DR
This paper introduces the weak k-metric dimension of graphs, a new measure that generalizes classical metric dimensions by considering the sum of distance differences, and analyzes its properties for various graph classes.
Contribution
The paper defines the weak k-metric dimension, explores its properties, and computes it for several fundamental graph classes, extending understanding of metric-based graph parameters.
Findings
Weak k-metric dimension is stronger than classical but weaker than k-metric dimension.
kappa(G) is determined for paths, stars, cycles, and bipartite graphs.
Exact weak k-metric dimensions are established for trees and grid graphs.
Abstract
The classical (vertex) metric dimension of a graph G is defined as the cardinality of a smallest set S in V (G) such that any two vertices x and y from G have different distances to least one vertex from S: The k-metric dimension is a generalization of that notion where it is required that any pair of vertices has different distances to at least k vertices from S: In this paper, we introduce the weak k-metric dimension of a graph G; which is defined as the cardinality of a smallest set of vertices S such that the sum of the distance differences from any pair of vertices to all vertices of S is at least k: This dimension is "stronger" than the classical metric dimension, yet "weaker" than k-metric dimension, and it can be formulated as an ILP problem. The maximum k for which the weak k-metric dimension is defined is denoted by kappa(G). We first prove several properties of the weak…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems
