Metric dimension of dual polar graphs

A resolving set for a graph Γ is a collection of vertices S, chosen so that for each vertex v, the list of distances from v to the members of S uniquely specifies v. The metric dimensionμ(Γ) is the smallest size of a resolving set for Γ. We consider the metric dimension of the dual polar graphs, and show that it is at most the rank over R of the incidence matrix of the corresponding polar space. We then compute this rank to give an explicit upper bound on the metric dimension of dual polar graphs, as well as the halved dual polar graphs.