Extremal graphs for threshold metric dimension

In this thesis, we consider the threshold metric dimension problem of graphs, related to and motivated by source detection.<br/>We construct a graph G = (V,E) for a given set of sensors of size m: {s1, s2, ..., sm} and a range k &gt; 0. We want that each node v ∈ V has a unique combination of distances (dk (s1, v),dk (s2, v), ...,dk (sm, v)),...