Metric dimension of some distance-regular graphs

Authors:
Jun Guo;Kaishun Wang;Fenggao Li
Affiliations:
Math. and Inf. College, Langfang Teachers' College, Langfang, China 065000;Sch. Math. Sci. & Lab. Math. Com. Sys., Beijing Normal University, Beijing, China 100875;Dept. of Math., Hunan Institute of Science and Technology, Yueyang, China 414006
Venue:
Journal of Combinatorial Optimization
Year:
2013

Citing 3
Cited 0

Landmarks in graphs

Discrete Applied Mathematics
Resolvability in graphs and the metric dimension of a graph

Discrete Applied Mathematics
On Metric Generators of Graphs

Mathematics of Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.