49 citations · 76 across the 19 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.CO2013★ 17 cited
The metric dimension of small distance-regular and strongly regular graphs
Robert F. Bailey
A {\em resolving set} for a graph is a collection of vertices , chosen so that for each vertex , the list of distances from to the members of uniquely specifies $…
math.CO2013★ 4 cited
On the metric dimension of imprimitive distance-regular graphs
Robert F. Bailey
A resolving set for a graph is a collection of vertices , chosen so that for each vertex , the list of distances from to the members of uniquely specifies . Th…