13 citations · 15 across the 3 of their papers we have counts for
1 paper · 1 filter
Lucas Laird, Richard C. Tillquist, Stephen Becker +1
A subset of vertices in a graph is called resolving when the geodesic distances to those vertices uniquely distinguish every vertex in the graph. Here, we characterize the resolvab…