Metric dimension of some distance-regular graphs

Details Metric dimension of some distance-regular graphs Metric dimension of some distance-regular graphs

2011-05-10

arxiv.org/abs/1105.1847v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Metric dimension of some distance-regular graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Metric dimension of some distance-regular graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Metric dimension of some distance-regular graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-278682