Metric dimension of some distance-regular graphs

Jun Guo (), Kaishun Wang () and Fenggao Li ()
Additional contact information
Jun Guo: Langfang Teachers’ College
Kaishun Wang: Beijing Normal University
Fenggao Li: Hunan Institute of Science and Technology

Journal of Combinatorial Optimization, 2013, vol. 26, issue 1, No 15, 190-197

Abstract: 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.

Keywords: Metric dimension; Johnson graph; Doubled Odd graph; Doubled Grassmann graph; Twisted Grassmann graph (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-012-9459-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:26:y:2013:i:1:d:10.1007_s10878-012-9459-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-012-9459-x

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().