Skip to main content
Log in

Metric dimension of some distance-regular graphs

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

A resolving set of a graph is a set of vertices with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. In this paper, we construct a resolving set of Johnson graphs, doubled Odd graphs, doubled Grassmann graphs and twisted Grassmann graphs, respectively, and obtain the upper bounds on the metric dimension of these graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

References

Download references

Acknowledgements

This research is partially supported by NSF of Hebei Province, TPF-2011-11 of Hebei Province, NSF of China (10971052, 10871027), NCET-08-0052, Langfang Teachers’ College (LSZB201104), Hunan Provincial Natural Science Foundation of China (09JJ3006), and the Fundamental Research Funds for the Central Universities of China.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kaishun Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guo, J., Wang, K. & Li, F. Metric dimension of some distance-regular graphs. J Comb Optim 26, 190–197 (2013). https://doi.org/10.1007/s10878-012-9459-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-012-9459-x

Keywords

Navigation