Abstract
A resolving set for a graph Gamma 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 dimensionmu (Gamma ) is the smallest size of a resolving set for Gamma . We consider the metric dimension of the dual polar graphs, and show that it is at most the rank over mathbb {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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
