1 paper
Martin Knor, Jelena Sedlar, Riste Škrekovski
A set of vertices S is a resolving set of a graph G; if for every pair of vertices x and y in G, there exists a vertex s in S such that x and y differ in distance to s. A smallest…