1 paper
Florent Foucaud, Esther Galby, Liana Khazaliya +4
For a graph G, a subset S⊆V(G) is called a resolving set of G if, for any two vertices u,v∈V(G), there exists a vertex w∈S such that d(w,u)=d(w,v). T…